#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;



signed main(){

    int N; cin >> N;
    vec V(N), W(N);
    REP(i, N) cin >> V[i] >> W[i];

    int n = min(bit(9), N);
    const int MM = 100000;
    mat dp(n + 1, vec(MM + 1, 0));
    FOR(j, W[0], MM + 1) dp[1][j] = V[0];
    FOR(i, 2, n + 1){
        REP(j, MM + 1){
            dp[i][j] = dp[i / 2][j];
            if(j - W[i - 1] >= 0) Max(dp[i][j], dp[i / 2][j - W[i - 1]] + V[i - 1]);
        }
    }

    int Q; cin >> Q;
    vec ans(Q, 0);
    REP(q, Q){
        int v, L;
        cin >> v >> L;
        if(v <= n){
            ans[q] = dp[v][L];
        }else{
            vec vs;
            int v0 = v;
            while(v0 > n){
                vs.pb(v0);
                v0 /= 2;
            }
            int sz = SZ(vs);
            REP(j, bit(sz)){
                int sV = 0, sW = 0;
                REP(k, sz) if((j >> k) & 1){
                    sV += V[vs[k] - 1];
                    sW += W[vs[k] - 1];
                }
                if(sW <= L) Max(ans[q], sV + dp[v0][L - sW]);
            }
        }
    }
    Out(ans);

    return 0;
}


Measured memory_bytes: 410916