#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
 
const ll INF = 2e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod){ll x=1;while(b){while(!(b&1)){(a*=a)%=mod;b>>=1;}(x*=a)%=mod;b--;}return x;}
void YES(bool cond){ if(cond){ p("YES");}else{ p("NO");} return;}
void Yes(bool cond){ if(cond){ p("Yes");}else{ p("No");} return;}

/*
ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

void init(){
    struct timeval _time;
    gettimeofday(&_time, NULL);
    ll usec = _time.tv_usec * 1000000;
    srand(usec);
    return;
}

ll range(ll a,ll b){
    // generate random number [a, b]
    // if b >= 10^8, this might not be precise
    ll num = rand() % (1 + b - a) + a;
    return num;
}



bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;
ll value[270005], weight[270005];
ll dp[520][100005];
string s;

const int bound = 512;

void dfs(ll v, ll p){
    for(ll i=0;i<=100000;i++){
        dp[v][i] = max(dp[v][i], dp[p][i]);
        if (i + weight[v] <= 100000) dp[v][i + weight[v]] = max(dp[v][i + weight[v]], dp[p][i] + value[v]);
    }
    if (2 * v <= bound) dfs(2 * v, v);
    if (2 * v + 1 <= bound) dfs(2 * v + 1, v);
    return;
}

void query(ll v, ll max_w){
    vector<P> bag;
    while(v > bound){
        bag.pb(P(weight[v], value[v]));
        v /= 2;
    }
    ll n = (ll)bag.size();
    ll bit = (1ll << n);
    ll ans = 0;
    for(ll i=0;i<bit;i++){
        ll vsum = 0, wsum = 0;
        for(ll j=0;j<n;j++){
            if(i & (1ll << j)){
                vsum += bag[j].second, wsum += bag[j].first;
            }
        }
        if(wsum > max_w)continue;
        ans = max(ans, vsum + dp[v][max_w - wsum]);
    }
    p(ans);
    return;
}

void solve(){
    cin >> n;
    for(ll i=1;i<=n;i++){
        cin >> value[i] >> weight[i];
    }
    dfs(1, 0);
    /*
    for(ll i=1;i<=n;i++){
        for(ll j=0;j<30;j++){
            pe(dp[i][j]);
        }
        el;
    }
    */
    ll q;
    cin >> q;
    for(ll i=0;i<q;i++){
        cin >> a >> b;
        query(a, b);
    }
    return;
}

int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}
















Measured memory_bytes: 407808