#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int64 > V(N + 1), W(N + 1);
  for(int i = 1; i <= N; i++) {
    cin >> V[i] >> W[i];
  }
  int Q;
  cin >> Q;
  vector< vector< pair< int, int > > > ev(N + 1);
  for(int i = 0; i < Q; i++) {
    int v, l;
    cin >> v >> l;
    ev[v].emplace_back(l, i);
  }
  vector< int > ans(Q);
  auto rec = MFP([&](auto rec, int idx, int dep, const vector< int > &dp, int w, int v) -> void {
    if(idx > N) return;
    for(auto &p : ev[idx]) {
      int neq = p.first - w;
      if(neq >= 0) chmax(ans[p.second], v + dp[neq]);
    }
    for(auto &p : ev[idx]) {
      int neq = p.first - w - W[idx];
      if(neq >= 0) chmax(ans[p.second], v + dp[neq] + V[idx]);
    }
    if(dep < 9) {
      vector< int > dp2 = dp;
      for(int i = 100000; i >= W[idx]; i--) chmax(dp2[i], dp2[i - W[idx]] + V[idx]);
      rec(2 * idx + 0, dep + 1, dp2, w, v);
      rec(2 * idx + 1, dep + 1, dp2, w, v);
    } else {
      rec(2 * idx + 0, dep + 1, dp, w + W[idx], v + V[idx]);
      rec(2 * idx + 0, dep + 1, dp, w, v);
      rec(2 * idx + 1, dep + 1, dp, w + W[idx], v + V[idx]);
      rec(2 * idx + 1, dep + 1, dp, w, v);
    }
  });
  vector< int > dp(100001);
  rec(1, 0, dp, 0, 0);
  for(auto &p : ans) cout << p << "\n";
}


Measured memory_bytes: 20848