/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<18;
int V[SIZE],w[SIZE];
LL dp[12][SIZE];
int v[SIZE],L[SIZE];
int N;
VI query[512];
LL an[SIZE];
const int MAX_V=100000;
int get_p(int x){
    while(x>=512)x>>=1;
    return x;
}
template <class T>
void maa(T& x,T y){
    if(x<y)x=y;
}
template <class T>
void mii(T& x,T y){
    if(x>y)x=y;
}
LL dfs2(VPII& AA,LL dp0[],int it,int now_w,LL now_v){
    if(now_w<0)return 0;
    LL ma=dp0[now_w]+now_v;
    if(it==SZ(AA))return ma;
    return max({ma,dfs2(AA,dp0,it+1,now_w,now_v),dfs2(AA,dp0,it+1,now_w-AA[it].F,now_v+AA[it].S)});
}
void dfs(int x,int lv){
    if(x>=512)return;
    memcpy(dp[lv+1],dp[lv],sizeof(dp[lv]));
    for(int i=MAX_V-w[x];i>=0;i--){
        maa(dp[lv+1][i+w[x]],dp[lv][i]+V[x]);
    }
    FOR(i,1,MAX_V)maa(dp[lv+1][i],dp[lv+1][i-1]);
    for(int id:query[x]){
        if(v[id]==x){
            an[id]=dp[lv+1][L[id]];
        }
        else{
            int y=v[id];
            VPII AA;
            while(y>x){
                AA.PB(MP(w[y],V[y]));
                y>>=1;
            }
            an[id]=dfs2(AA,dp[lv+1],0,L[id],0);
        }
    }
    dfs(x*2,lv+1);
    dfs(x*2+1,lv+1);
}
void solve() {
    R(N);
    FOR(i,1,N)R(V[i],w[i]);
    int Q;
    R(Q);
    FOR(i,1,Q){
        R(v[i],L[i]);
        query[get_p(v[i])].PB(i);
    }
    dfs(1,0);
    FOR(i,1,Q)W(an[i]);
}
int main(){
#define MULTITEST 0
#if MULTITEST    
    CASET{
        solve();
    }
#else
    solve();
#endif
    return 0;
}


Measured memory_bytes: 26376