import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto V = new int[N + 1];
      auto W = new int[N + 1];
      foreach (u; 1 .. N + 1) {
        V[u] = readInt();
        W[u] = readInt();
      }
      const Q = readInt();
      auto X = new int[Q];
      auto L = new int[Q];
      foreach (q; 0 .. Q) {
        X[q] = readInt();
        L[q] = readInt();
      }
      
      alias Entry = Tuple!(int, "w", int, "v");
      auto aux = new Entry[1 << 9];
      foreach (q; 0 .. Q) {
        int[] us;
        for (int u = X[q]; u; u >>= 1) {
          us ~= u;
        }
        const usLen = cast(int)(us.length);
        const half = usLen / 2;
        auto es = [Entry(0, 0)];
        foreach (i; 0 .. half) {
          foreach (h; 0 .. 1 << i) {
            aux[h].w = es[h].w + W[us[i]];
            aux[h].v = es[h].v + V[us[i]];
          }
          es = es.merge(aux[0 .. 1 << i]).array;
        }
        auto fs = [Entry(0, 0)];
        foreach (i; 0 .. usLen - half) {
          foreach (h; 0 .. 1 << i) {
            aux[h].w = fs[h].w + W[us[half + i]];
            aux[h].v = fs[h].v + V[us[half + i]];
          }
          fs = fs.merge(aux[0 .. 1 << i]).array;
        }
        int ans;
        int mx;
        for (int g = 0, h = 1 << (usLen - half); h--; ) {
          for (; g < 1 << half && es[g].w + fs[h].w <= L[q]; ++g) {
            chmax(mx, es[g].v);
          }
          if (g > 0) {
            chmax(ans, mx + fs[h].v);
          }
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
