#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl value(N + 1, 0), weight(N + 1, 0);
  REP(i, N) cin >> value[i + 1] >> weight[i + 1];

  vvl dp = VVL(1LL << 9, 100010, 0);
  stack<ll> sta;
  sta.push(1);
  while (!sta.empty()) {
    ll v = sta.top();
    sta.pop();
    dp[v] = dp[v >> 1];
    for (ll sum_w = 100010; sum_w >= 0; sum_w--) {
      if (sum_w + weight[v] < 100010) {
        dp[v][sum_w + weight[v]] =
            max(dp[v][sum_w + weight[v]], dp[v][sum_w] + value[v]);
      }
    }
    if ((v << 1) <= N && (v << 1) < (1LL << 9))
      sta.push(v << 1);
    if ((v << 1) + 1 <= N && (v << 1) + 1 < (1LL << 9))
      sta.push((v << 1) + 1);
  }

  ll Q;
  cin >> Q;
  vl vv(Q), L(Q);
  REP(i, Q) cin >> vv[i] >> L[i];

  REP(q, Q) {
    ll v = vv[q];
    if (v < (1 << 9)) {
      cout << dp[v][L[q]] << endl;
      continue;
    }
    vl ver;

    for (; v >= (1 << 9); v >>= 1)
      ver.push_back(v);
    ll m = ver.size();
    ll sv = 0;
    ll sw = 0;
    ll ans = dp[v][L[q]];
    FOR(tmp, 1, (1 << m)) {
      ll s = (tmp ^ (tmp >> 1));
      ll i = __builtin_ctz(tmp);
      if (s & (1 << i)) {
        sv += value[ver[i]];
        sw += weight[ver[i]];
      } else {
        sv -= value[ver[i]];
        sw -= weight[ver[i]];
      }
      if (sw <= L[q]) {
        ans = max(ans, sv + dp[v][L[q] - sw]);
      }
    }
    cout << ans << endl;
  }

  return 0;
}


Measured memory_bytes: 410204