#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
ll k=1<<9,mx=100005;
ll V=0,W=0,ans;
vi t;
void dfs(int cnt,ll x,ll y,vi&v,vi&w,vvi&memo){
    if(cnt==t.size()){
        if(y-W>=0)chmax(ans,V+memo[x][y-W]);
        return;
    }
    dfs(cnt+1,x,y,v,w,memo);
    V+=v[t[cnt]];W+=w[t[cnt]];
    if(y-W>=0)dfs(cnt+1,x,y,v,w,memo);
    V-=v[t[cnt]];W-=w[t[cnt]];
}
int main(){
    ll n,q;cin>>n;
    chmin(k,n);
    vi v(n),w(n);
    rep(i,n)cin>>v[i]>>w[i];
    cin>>q;
    vvi memo(k,vi(mx));
    rep(i,k){
        if(i){
            ll p=(i-1)/2;
            memo[i]=memo[p];
            rep(j,mx-w[i])chmax(memo[i][w[i]+j],memo[p][j]+v[i]);
        }
        chmax(memo[i][w[i]],v[i]);
        REP(j,1,mx)chmax(memo[i][j],memo[i][j-1]);
    }
    rep(qq,q){
        ll x,y;cin>>x>>y;
        x--;
        t=vi(0);
        while(x>=k){
            t.pb(x);x=(x-1)/2;
        }
        ans=memo[x][y];
        dfs(0,x,y,v,w,memo);
        out(ans);
    }
}

Measured memory_bytes: 409536