#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>

#include <climits>


using namespace std;
//#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> pli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; //MINPQ<pii> pq;
template <class T>
using MAXPQ = std::priority_queue<T>;


const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {0, 0, -1, 1};
const int dy4[4] = {-1, 1, 0, 0};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i) (((B>>i) & 1) == 1) ? true : false //Bのi番目のbitが1ならtrue, 0ならfalse

//debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n;
int v[1<<18], w[1<<18];
int q;
vector<vector<pii>> ps(1<<12);
int idx[1<<12];

void pre_process() {
  rep(V, min(1<<12, n)) {
    int x = V;
    vector<int> tmpv, tmpw;
    while (x > 0) {
      tmpv.push_back(v[x]);
      tmpw.push_back(w[x]);
      x = (x - 1) / 2;
    }
    tmpv.push_back(v[0]);
    tmpw.push_back(w[0]);

    int m = tmpv.size();
    ps[V].resize(1<<m);
    rep(i, 1<<m) {
      int sw = 0, sv = 0;
      rep(j, m) {
        if (i >> j & 1) {
          sv += tmpv[j];
          sw += tmpw[j];
        }
      }
      ps[V][i] = {sw, sv};
    }
    sort(all(ps[V]));
    idx[V] = 1;
    rep2(i, 1, 1<<m) {
      if (ps[V][idx[V] - 1].se < ps[V][i].se) {
        ps[V][idx[V]++] = ps[V][i];
      }
    }
  }
}

int solve(int L, vector<int>& tmpv, vector<int>& tmpw, vector<int>& node) {
  int m = tmpv.size();
  int st = -1;
  int V = -1;
  rep(i, m) {
    if (node[i] >= (1<<12)) {
      st = i;
      break;
    }
    V = node[i];
  }
  assert(st != -1);
  assert(V < (1<<12));
  int res = 0;
  rep(i, 1<<(m - st)) {
    int sw = 0, sv = 0;
    rep(j, m - st) {
      if (i>>j & 1) {
        sv += tmpv[st + j];
        sw += tmpw[st + j];
      }
    }
    if (sw <= L) {
      int tv = (lower_bound(ps[V].begin(), ps[V].begin() + idx[V], make_pair(L-sw, INF)) - 1)->second;
      res = max(res, sv + tv);
    }
  }
  return res;
}

signed main() {
  cin >> n;
  rep(i, n) cin >> v[i] >> w[i];
  cin >> q;
  pre_process();
  rep(_, q) {
    int x, L;
    cin >> x >> L;
    x--;
    int V = x;
    vector<int> tmpv, tmpw;
    vector<int> node;
    while (x > 0) {
      tmpv.push_back(v[x]);
      tmpw.push_back(w[x]);
      node.push_back(x);
      x = (x - 1) / 2;
    }
    tmpv.push_back(v[0]);
    tmpw.push_back(w[0]);
    node.push_back(0);
    reverse(all(tmpv));
    reverse(all(tmpw));
    reverse(all(node));
    int ans = 0;
    if (V <= (1<<12)) {
      ans = (lower_bound(ps[V].begin(), ps[V].begin() + idx[V], make_pair(L, INF)) - 1)->second;
    }
    else {
      ans = solve(L, tmpv, tmpw, node);
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 93280