#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/
bool DBG = false;

struct rand_int_
{
    using lint = long long;
    mt19937 mt;
    rand_int_() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
    lint operator()(lint x) { return this->operator()(0, x); } // [0, x)
    lint operator()(lint l, lint r) {
        uniform_int_distribution<lint> d(l, r - 1);
        return d(mt);
    }
} rnd;

int main()
{
    int N;
    cin >> N;
    vector<int> V(N + 1), W(N + 1);
    FOR(i, 1, N + 1) cin >> V[i] >> W[i];

    if (DBG) {
        N = (1 << 18) - 1;
        V.resize(N, 1);
        W.resize(N, 1);
    }

    int Q;
    cin >> Q;
    vector<vector<pint>> i2qw(N + 1);
    REP(q, Q)
    {
        int v, w;
        cin >> v >> w;
        i2qw[v].emplace_back(q, w);
    }

    if (DBG)
    {
        FOR(q, Q, 1e5)
        {
            int v = rnd(1, 100001), w = rnd(1, 100000);
            i2qw[v].emplace_back(q, w);
        }
        Q = 1e5;
    }

    vector<int> ret(Q);
    int lmax = 101010;
    vector<int> nv(lmax, 0);

    vector<pint> conb{{0, 0}}, conb_mem;
    int dth = 9;

    auto dfs = [&](auto &&dfs, int now, int depth) -> void {
        if (now > N) return;
        int v = V[now], w = W[now];
        pint p(v, w);
        int n = conb.size();
        conb.resize(n * 2);
        FOR(i, n, n * 2) conb[i] = conb[i - n] + p;

        if (depth == dth)
        {
            nv.assign(lmax, 0);
            for (auto [v, w] : conb) if (w < lmax) chmax(nv[w], v);
            REP(i, lmax - 1) chmax(nv[i + 1], nv[i]);

            conb_mem = conb;
            conb = {{0, 0}};
        }

        for (auto [q, wlimit] : i2qw[now]) if (wlimit < lmax)
        {
            for (auto [v, w] : conb)
                if (w <= wlimit)
                {
                    chmax(ret[q], v + nv[wlimit - w]);
                }
        }

        if (now * 2 <= N) dfs(dfs, now * 2, depth + 1);
        if (now * 2 + 1 <= N) dfs(dfs, now * 2 + 1, depth + 1);

        if (depth == dth)
        {
            nv.assign(lmax, 0);
            conb = conb_mem;
            conb_mem.clear();
        }
        conb.resize(n);
    };

    dfs(dfs, 1, 0);
    for (auto r : ret) cout << r << '\n';
}


Measured memory_bytes: 15528