#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

// Yay!!
#define endl codeforces

// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }

// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }
#endif

// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }

// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; 
}


const ssize_t SIZE = 1e5 + 10, SIZE2 = 512;
mdarray<ll, SIZE2 * 4, SIZE> dp;

struct Solver {
    using mp_t = std::unordered_map<ll, ll>;
    ll n, q;
    vec<ll> vv, wv;
    vvec<pll> qv;
    vec<ll> ans;
    vvec<pll> table;
    ll tidx = 0;
    ll dpidx = 0;

    Solver(ll n) : n(n), vv(n), wv(n), qv(n), table(SIZE2 * 4) {
        for (ll i = 0; i < n; i++) std::cin >> vv[i] >> wv[i];
        std::cin >> q;
        ans.resize(q);
        for (ll i = 0; i < q; i++) {
            ll v, l;
            std::cin >> v >> l;
            qv[v - 1].emplace_back(l, i);
        }
    }

    void rec(ll cur, ll dep, vec<pll> &res, ll dp_idx) {
        ssize_t sz = res.size();
        {
            ll v = vv[cur], w = wv[cur];
            for (ll i = 0; i < sz; i++) {
                auto [ a, b ] = res[i];
                res.emplace_back(a + w, b + v);
            }
        }
        if (dep == 9) {
            ll idx = dpidx++;
            for (auto &&e : res) {
                auto [ k, v ] = e;
                if (k < SIZE) chmax(dp[idx][k], v);
            }
            for (ll i = 1; i < SIZE; i++) chmax(dp[idx][i], dp[idx][i - 1]);
            for (auto &&e : qv[cur]) {
                auto [ l, i ] = e;
                ans[i] = dp[idx][l];
            }

            auto &nxt = table[tidx++];
            nxt.emplace_back(0, 0);
            if (2 * cur + 1 < n) rec(2 * cur + 1, dep + 1, nxt, idx);
            if (2 * cur + 2 < n) rec(2 * cur + 2, dep + 1, nxt, idx);
        } else {
            for (auto &&e : qv[cur]) {
                auto [ l, i ] = e;
                if (dp_idx != -1) chmax(ans[i], dp[dp_idx][l]);
                for (auto &&e2 : res) {
                    auto [ key, val ] = e2;
                    if (key <= l) {
                        chmax(ans[i], val);
                        if (dp_idx != -1) chmax(ans[i], dp[dp_idx][l - key] + val);
                    }
                }
            }
            if (2 * cur + 1 < n) rec(2 * cur + 1, dep + 1, res, dp_idx);
            if (2 * cur + 2 < n) rec(2 * cur + 2, dep + 1, res, dp_idx);
        }
        while (sz < (ssize_t)res.size()) res.pop_back();
    }

    auto solve() {
        table[tidx++].emplace_back(0, 0);
        rec(0, 0, table[0], -1);
        return ans;
    }
};

int main() {
    ll n;
    std::cin >> n;
    Solver solver(n);
    auto ans = solver.solve();
    for (ll e : ans) std::cout << e << "\n";
    return 0;
}


Measured memory_bytes: 420252