#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(lint)(n);i++)
#define REP(i,n) for(int i=1;i<=(lint)(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<lint, lint> P;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, unsigned int b) {
	if (!b)return T(1);
	if (b & 1)return mypow(a, b - 1) * a;
	T memo = mypow(a, b >> 1);
	return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
	if (!b)return 1;
	if (b & 1)return modpow(a, b - 1, m) * a % m;
	lint memo = modpow(a, b >> 1, m);
	return memo * memo % m;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size() - 1)std::cout << vec[i] << " ";
	std::cout << vec.back() << std::endl;
}
template<typename T>
void printArray(T l, T r) {
	T rprev = r;
	rprev--;
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
int n,q,v[300010],w[300010],l,mid;
int table[1100][100010];
int ans;
void dfs(int node,int sum,int value){
	if(node<(1<<(mid+1))){
		chmax(ans,table[node-(1<<mid)][l-sum]+value);
		return;
	}
	if(sum+w[node]<=l)dfs(node/2,sum+w[node],value+v[node]);
	dfs(node/2,sum,value);
}
void dfs2(int node,int sum,int value){
	if(node==0){
		chmax(ans,value);
		return;
	}
	if(sum+w[node]<=l)dfs2(node/2,sum+w[node],value+v[node]);
	dfs2(node/2,sum,value);
}
int main(){
	std::cin>>n;
	REP(i,n)std::cin>>v[i]>>w[i];
	mid=log2(n+1)/2;
	for(int i=1<<mid;i<(1<<(mid+1));i++){
		int m=i-(1<<mid),node=i;
		while(node){
			for(int j=100000-w[node];j>=0;j--){
				chmax(table[m][j+w[node]],table[m][j]+v[node]);
			}
			node/=2;
		}
		rep(j,100000)chmax(table[m][j+1],table[m][j]);
	}
	std::cin>>q;
	rep(i,q){
		int u;
		std::cin>>u>>l;
		ans=0;
		if(u<(1<<mid))dfs2(u,0,0);
		else dfs(u,0,0);
		std::cout<<ans<<std::endl;
	}
	return 0;
}


Measured memory_bytes: 205708