#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 1 << 9;
const int M = 1e5 + 10;
int dp[N + 1][M];

int main() {
  int n;
  cin >> n;
  vector<int> v(n + 1), w(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> v[i] >> w[i];
  }
  vector<int> a;
  for (int i = 1; i <= n && i <= N; ++i) {
    a.clear();
    for (int t = i; t; t /= 2) a.push_back(t);
    int m = SZ(a);
    for (int k = 0; k < (1 << m); ++k) {
      int W = 0, V = 0;
      for (int j = 0; j < m; ++j) {
        if ((k >> j) & 1) W += w[a[j]], V += v[a[j]];
      }
      if (W < M) dp[i][W] = max(dp[i][W], V);
    }
    for (int k = 1; k < M; ++k) dp[i][k] = max(dp[i][k], dp[i][k - 1]);
  }
  int q;
  cin >> q;
  while (q--) {
    int u, C;
    cin >> u >> C;
    a.clear();
    while (u > N) {
      a.push_back(u);
      u /= 2;
    }
    int m = SZ(a), best = 0;
    for (int k = 0; k < (1 << m); ++k) {
      int W = 0, V = 0;
      for (int j = 0; j < m; ++j) {
        if ((k >> j) & 1) W += w[a[j]], V += v[a[j]];
      }
      // trace(u, m, k, W, V, C, dp[u][C - W]);
      if (W <= C) best = max(best, dp[u][C - W] + V);
    }
    cout << best << '\n';
  }
  return 0;
}


Measured memory_bytes: 204980