import std.stdio;
import std.string;
import std.format;
import std.conv;
import std.typecons;
import std.algorithm;
import std.functional;
import std.bigint;
import std.numeric;
import std.array;
import std.math;
import std.range;
import std.container;
import std.concurrency;
import std.traits;
import std.uni;
import std.regex;
import core.bitop : popcnt;
alias Generator = std.concurrency.Generator;

enum long INF = long.max/5;

struct P {
  long v, w;
}

void main() {
  long N;
  scanln(N);

  P[] ps = new P[N+1];
  foreach(i; 0..N) {
    scanln(ps[i+1]);
  }

  long T = 100000;

  long[][] dp = new long[][N+1];
  dp[0] = new long[T+1];
  dp[0][] = -INF;
  dp[0][0] = 0;

  long[] ys = new long[T+1];
  long[] bs = new long[N+1];

  bool[] zs = new bool[32];

  void f(long index) {
    long i = index;
    long t = 0;
    while(dp[i].empty) {
      zs[t] = i&1;
      i /= 2;
      t++;
    }
    foreach(k; 0..t) {
      i *= 2;
      i += zs[t-k-1];
      if (i == 1 || (i == i/2*2 && (i/2*2+1 > N || bs[i/2*2+1] == 0)) || i == i/2*2+1) {
        dp[i] = dp[i/2];
      } else {
        dp[i] = dp[i/2][0..bs[i]+1].dup;
      }
      foreach_reverse(j; 0..bs[i]+1) {
        if (j+ps[i].w > bs[i]) continue;
        dp[i][j+ps[i].w].ch!max(dp[i/2][j] + ps[i].v);
      }
    }

    ys[0..bs[index]+1] = dp[index][0..bs[index]+1];
    foreach(j; 0..bs[index]) {
      ys[j+1].ch!max(ys[j]);
    }
  }

  void rec(long i, bool first) {
    assert(bs[i] > 0);
    if (dp[i].empty) {
      rec(i/2, false);
      if (i == 1 || (i == i/2*2 && (i/2*2+1 > N || bs[i/2*2+1] == 0)) || i == i/2*2+1) {
        dp[i] = dp[i/2];
      } else {
        dp[i] = dp[i/2][0..bs[i]+1].dup;
      }
      foreach_reverse(j; 0..bs[i]+1) {
        if (j+ps[i].w > bs[i]) continue;
        dp[i][j+ps[i].w].ch!max(dp[i/2][j] + ps[i].v);
      }
      if (first) {
        ys[0..bs[i]+1] = dp[i][0..bs[i]+1];
        foreach(j; 0..bs[i]) {
          ys[j+1].ch!max(ys[j]);
        }
      }
    }
  }

  struct R {
    long index;
    long u, L;
  }

  long Q;
  scanln(Q);
  R[] rs = new R[Q];
  foreach(i; 0..Q) {
    rs[i].index = i;
    scanln(rs[i].u, rs[i].L);
  }

  rs.sort!"a.u < b.u";

  long[] xs = new long[Q];

  foreach(r; rs) {
    bs[r.u].ch!max(r.L);
  }
  foreach_reverse(i; 1..N+1) {
    if (i*2 <= N) bs[i].ch!max(bs[i*2]);
    if (i*2+1 <= N) bs[i].ch!max(bs[i*2 + 1]);
  }
  bs[0].ch!max(bs[1]);

  foreach(r; rs) {
    f(r.u);
    xs[r.index] = ys[r.L];
  }

  xs.each!writeln;
}

// ----------------------------------------------


void times(alias fun)(long n) {
  // n.iota.each!(i => fun());
  foreach(i; 0..n) fun();
}
auto rep(alias fun, T = typeof(fun()))(long n) {
  // return n.iota.map!(i => fun()).array;
  T[] res = new T[n];
  foreach(ref e; res) e = fun();
  return res;
}

T ceil(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  // `(x+y-1)/y` will only work for positive numbers ...
  T t = x / y;
  if (y > 0 && t * y < x) t++;
  if (y < 0 && t * y > x) t++;
  return t;
}

T floor(T)(T x, T y) if (isIntegral!T || is(T == BigInt)) {
  T t = x / y;
  if (y > 0 && t * y > x) t--;
  if (y < 0 && t * y < x) t--;
  return t;
}

ref T ch(alias fun, T, S...)(ref T lhs, S rhs) {
  return lhs = fun(lhs, rhs);
}
unittest {
  long x = 1000;
  x.ch!min(2000);
  assert(x == 1000);
  x.ch!min(3, 2, 1);
  assert(x == 1);
  x.ch!max(100).ch!min(1000); // clamp
  assert(x == 100);
  x.ch!max(0).ch!min(10); // clamp
  assert(x == 10);
}

mixin template Constructor() {
  import std.traits : FieldNameTuple;
  this(Args...)(Args args) {
    // static foreach(i, v; args) {
    foreach(i, v; args) {
      mixin("this." ~ FieldNameTuple!(typeof(this))[i]) = v;
    }
  }
}

template scanln(Args...) {
  enum sep = " ";

  enum n = (){
    long n = 0;
    foreach(Arg; Args) {
      static if (is(Arg == class) || is(Arg == struct) || is(Arg == union)) {
        n += Fields!Arg.length;
      } else {
        n++;
      }
    }
    return n;
  }();

  enum fmt = n.rep!(()=>"%s").join(sep);

  enum argsString = (){
    string[] xs = [];
    foreach(i, Arg; Args) {
      static if (is(Arg == class) || is(Arg == struct) || is(Arg == union)) {
        foreach(T; FieldNameTuple!Arg) {
          xs ~= "&args[%d].%s".format(i, T);
        }
      } else {
        xs ~= "&args[%d]".format(i);
      }
    }
    return xs.join(", ");
  }();

  void scanln(auto ref Args args) {
    string line = readln.chomp;
    static if (__VERSION__ >= 2074) {
      mixin(
        "line.formattedRead!fmt(%s);".format(argsString)
      );
    } else {
      mixin(
        "line.formattedRead(fmt, %s);".format(argsString)
      );
    }
  }
}

// fold was added in D 2.071.0
static if (__VERSION__ < 2071) {
  template fold(fun...) if (fun.length >= 1) {
    auto fold(R, S...)(R r, S seed) {
      static if (S.length < 2) {
        return reduce!fun(seed, r);
      } else {
        return reduce!fun(tuple(seed), r);
      }
    }
  }
}

// popcnt with ulongs was added in D 2.071.0
static if (__VERSION__ < 2071) {
  ulong popcnt(ulong x) {
    x = (x & 0x5555555555555555L) + (x>> 1 & 0x5555555555555555L);
    x = (x & 0x3333333333333333L) + (x>> 2 & 0x3333333333333333L);
    x = (x & 0x0f0f0f0f0f0f0f0fL) + (x>> 4 & 0x0f0f0f0f0f0f0f0fL);
    x = (x & 0x00ff00ff00ff00ffL) + (x>> 8 & 0x00ff00ff00ff00ffL);
    x = (x & 0x0000ffff0000ffffL) + (x>>16 & 0x0000ffff0000ffffL);
    x = (x & 0x00000000ffffffffL) + (x>>32 & 0x00000000ffffffffL);
    return x;
  }
}
