#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define REP(i, n) for(int i = 0;i < (n);i++)
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint inf=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

int main(void){
	int n,Q,i,j;cin>>n;
	vector<llint>V(n+1);
	vector<llint>W(n+1);
	for(i=1;i<=n;i++){cin>>V[i]>>W[i];}
	int m=sqrt(n);//これ以下の頂点に対しては、全列挙がある
	vector<vector<pair<llint,llint>>>rekyo(m+1);
	rekyo[0]={{0,0},{inf,inf}};
	for(i=1;i<=m;i++){
		int s=rekyo[i/2].size()-1;
		rekyo[i].reserve(s+s+1);
		vector<pair<llint,llint>> aaa(s+1);
		for(j=0;j<s;j++){aaa[j]={rekyo[i/2][j].fir+W[i],rekyo[i/2][j].sec+V[i]};}
		aaa[s]={inf,inf};
		int bx=0,by=0;
		while(bx<s||by<s){
			if(rekyo[i/2][bx].fir<=aaa[by].fir&&rekyo[i/2][bx].sec>=aaa[by].sec){by++;continue;}
			if(rekyo[i/2][bx].fir>=aaa[by].fir&&rekyo[i/2][bx].sec<=aaa[by].sec){bx++;continue;}
			
			
			if(rekyo[i/2][bx].fir<aaa[by].fir){rekyo[i].pub(rekyo[i/2][bx]);bx++;}
			else {rekyo[i].pub(aaa[by]);by++;}
		}
		rekyo[i].pub({inf,inf});
	}
	cin>>Q;
	//半分全列挙
	
	while(Q--){
		vector<pair<llint,llint>>dp={{0,0},{inf,inf}};
		int v;llint L;cin>>v>>L;
		while(v>m){
			int s=dp.size()-1;
			vector<pair<llint,llint>> ddp;
			ddp.reserve(s+s+1);
			vector<pair<llint,llint>> aaa(s+1);
			for(j=0;j<s;j++){aaa[j]={dp[j].fir+W[v],dp[j].sec+V[v]};}
			aaa[s]={inf,inf};
			int bx=0,by=0;
			while(bx<s||by<s){
				if(dp[bx].fir<=aaa[by].fir&&dp[bx].sec>=aaa[by].sec){by++;continue;}
				if(dp[bx].fir>=aaa[by].fir&&dp[bx].sec<=aaa[by].sec){bx++;continue;}
				
				
				if(dp[bx].fir<aaa[by].fir){ddp.pub(dp[bx]);bx++;}
				else {ddp.pub(aaa[by]);by++;}
			}
			ddp.pub({inf,inf});
			dp=move(ddp);
			v/=2;
		}
		//for(auto it:dp){cerr<<it.fir<<" "<<it.sec<<" b"<<endl;}
		llint ans=0;
		for(auto it:rekyo[v]){
			//cerr<<it.fir<<" "<<it.sec<<" a"<<endl;
			if(L-it.fir<0){continue;}
			chmax(ans,it.sec+dp[LBI(dp,{L-it.fir,inf})-1].sec);
		}
		cout<<ans<<endl;
	}
	return 0;
}


Measured memory_bytes: 9732