#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";

void chemthan() {
    const int magic = 11;
    int n; cin >> n;
    vi v(n + 1), w(n + 1);
    FOR(i, 1, n + 1) {
        cin >> v[i] >> w[i];
    }
    vi lev(n + 1);
    vector<vii> g(n + 1);
    FOR(i, 1, n + 1) {
        if (2 <= i) {
            lev[i] = lev[i / 2] + 1;
        }
        if (lev[i] < magic) {
            vii vals;
            int t = i;
            while (t) {
                vals.pb({w[t], v[t]});
                t /= 2;
            }
            static int x[1 << 20];
            static int y[1 << 20];
            g[i].pb({0, 0});
            FOR(msk, 1, 1 << sz(vals)) {
                int k = __lg(msk);
                int pmsk = msk ^ (1 << k);
                x[msk] = x[pmsk] + vals[k].fi;
                y[msk] = y[pmsk] + vals[k].se;
                g[i].pb({x[msk], y[msk]});
            }
            sort(all(g[i]));
            FOR(j, 1, sz(g[i])) {
                chkmax(g[i][j].se, g[i][j - 1].se);
            }
        }
    }
    int q; cin >> q;
    while (q--) {
        int u, d; cin >> u >> d;
        if (lev[u] < magic) {
            int res = 0;
            FOR(i, 0, sz(g[u])) {
                if (g[u][i].fi <= d) {
                    chkmax(res, g[u][i].se);
                }
            }
            cout << res << "\n";
        }
        else {
            int res = 0;
            vii vals;
            int t = u;
            while (magic <= lev[t]) {
                vals.pb({w[t], v[t]});
                t /= 2;
            }
            static int x[1 << 20];
            static int y[1 << 20];
            int k = upper_bound(all(g[t]), mp(d, INF)) - g[t].begin();
            if (k--) {
                chkmax(res, g[t][k].se);
            }
            FOR(msk, 1, 1 << sz(vals)) {
                int k = __lg(msk);
                int pmsk = msk ^ (1 << k);
                x[msk] = x[pmsk] + vals[k].fi;
                y[msk] = y[pmsk] + vals[k].se;
                k = upper_bound(all(g[t]), mp(d - x[msk], INF)) - g[t].begin();
                if (k--) {
                    chkmax(res, y[msk] + g[t][k].se);
                }
            }
            cout << res << "\n";
        }
    }
}

int main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    chemthan();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}


Measured memory_bytes: 34380