#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<int, int>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DynamicMod.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

const int B = 12;
int N, Q;
int V[1 << 18];
int W[1 << 18];
vector<PP> S[1 << 18];
int P[100000];
int L[100000];

void pre() {
	S[0] = { PP(0, 0) };
	REP(i, 1, min(N + 1, 2 << B)) {
		int par = i / 2;
		vector<PP> ret;
		for (PP p : S[par]) {
			int w = p.first;
			int v = p.second;
			ret.push_back(PP(w, v));
			ret.push_back(PP(w + W[i], v + V[i]));
		}
		sort(ret.begin(), ret.end(), [](PP a, PP b) {
			if (a.first != b.first) return a.first > b.first;
			return a.second < b.second;
		});

		for (auto p : ret) {
			while (!S[i].empty() && S[i].back().second <= p.second) {
				S[i].pop_back();
			}
			S[i].push_back(p);
		}
		reverse(S[i].begin(), S[i].end());
	}
}

int query(int p, int l) {
	int i;
	vector<PP> seq;
	seq.push_back(PP(0, 0));

	if (p < (2 << B)) {
		i = p;
	} else {
		while (p >= (2 << B)) {
			int sz = seq.size();
			REP(k, 0, sz) {
				int w = seq[k].first;
				int v = seq[k].second;
				if (w + W[p] > l) continue;
				seq.push_back(PP(w + W[p], v + V[p]));
			}
			p /= 2;
		}
		i = p;
	}

	int mx = 0;
	for (auto p : seq) {
		int w = p.first;
		int v = p.second;
		auto it = upper_bound(S[i].begin(), S[i].end(), PP(l - w, INFLL));
		--it;
		mx = max<int>(mx, it->second + v);
	}
	return mx;
}

int main() {
	cin >> N;
	REP(i, 1, N + 1) cin >> V[i] >> W[i];
	cin >> Q;
	REP(k, 0, Q) cin >> P[k] >> L[k];

	pre();

	REP(k, 0, Q) {
		cout << query(P[k], L[k]) << endl;
	}
	return 0;
}


Measured memory_bytes: 278924