#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


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

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
    os << "[";
    for (auto it = mp.begin(); it != mp.end(); ++it) {
        if (it != mp.begin()) {
            os << ", ";
        }
        os << *it;
    }
    return os << "]";
}

// edit

struct Solve {
    int N, Q;
    vector<ll> V, W;
    int k; //深さk以下ならいつもの
    int lim = 100001;

    vector<vector<ll>> dp;


    void solve() {
        cin >> N;
        V.resize(N + 1);
        W.resize(N + 1);
        REP(i, N) {
            cin >> V[i + 1] >> W[i + 1];
        }

//        k = max(1, min(9, (int) log2(N)));
        if (N < 1024) {
            k = 1;
        } else {
            k = 10;
        }
        dp.resize(1 << k, vector<ll>(lim, 0));

        for (int i = 1; i < dp.size(); ++i) {
            for (int j = lim - 1; j >= 0; --j) {
                if (j + W[i] < lim) {
                    chmax(dp[i][j + W[i]], dp[i][j] + V[i]);
                }
            }
            if (i * 2 < dp.size()) {
                dp[i * 2] = dp[i];
            }
            if (i * 2 + 1 < dp.size()) {
                dp[i * 2 + 1] = dp[i];
            }
        }


        cin >> Q;
        while (Q--) {
            int a, L;
            cin >> a >> L;
            if (a < (1 << k)) {
                ll ans = dp[a][L];
                cout << ans << endl;
                continue;
            }


            vector<ll> v, w;
            while (a >= (1 << k)) {
                v.push_back(V[a]);
                w.push_back(W[a]);
                a /= 2;
            }

            int sz = v.size();
            vector<pair<ll, ll>> wv;
            for (int mask = 0; mask < 1 << sz; ++mask) {
                int sw = 0, sv = 0;
                for (int i = 0; i < sz; ++i) {
                    if (mask >> i & 1) {
                        sw += w[i];
                        sv += v[i];
                    }
                }
                wv.push_back(make_pair(sw, sv));
            }

            sort(all(wv));
            for (int i = 1; i < wv.size(); ++i) {
                chmax(wv[i].second, wv[i - 1].second);
            }

            w.clear();
            v.clear();
            for (int i = 0; i < wv.size(); ++i) {
                w.push_back(wv[i].first);
                v.push_back(wv[i].second);
            }

            int root = a;

            ll ans = 0;
            for (int i = 0; i < w.size(); ++i) {
                int y = L - w[i];
                if (y < 0) continue;
                ll tmp = v[i] + dp[root][y];
                chmax(ans, tmp);
            }

//            int pt = (int) w.size() - 1;
//            for (int x = 0; x <= L; ++x) {
//                while (pt >= 0 && w[pt] + x > L) {
//                    pt--;
//                }
//                if (pt < 0) break;
//                ll tmp = dp[root][x] + v[pt];
//                chmax(ans, tmp);
//
//            }

            cout << ans << endl;


        }


    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    Solve().solve();


    return 0;
}


Measured memory_bytes: 810744