//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

namespace n91 {

struct item_t {
  u64 v;
  u64 w;

  item_t operator+(const item_t &r) const { return item_t({v + r.v, w + r.w}); }
};

std::vector<item_t> add(const std::vector<item_t> &a, const item_t e) {
  std::vector<item_t> ret;
  const usize n = a.size();
  ret.reserve(n * 2);
  usize l = 0;
  usize r = 0;
  while (r != n) {
    item_t next;
    if (l == n) {
      next = a[r] + e;
      r += 1;
    } else {
      auto la = a[l];
      auto ra = a[r] + e;
      if (la.w <= ra.w) {
        l += 1;
        next = la;
      } else {
        r += 1;
        next = ra;
      }
    }
    if (ret.empty() || ret.back().v < next.v) {
      ret.push_back(next);
    }
  }
  return std::move(ret);
}

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  static constexpr usize lim = 1 << 12;

  const usize n = scan<usize>();
  std::vector<item_t> item(n + 1);
  for (const usize i : rep(1, n + 1)) {
    auto &e = item[i];
    std::cin >> e.v >> e.w;
  }

  std::vector<std::vector<item_t>> dp(n + 1);
  dp[0].push_back(item_t({0, 0}));
  for (const usize i : rep(1, n + 1)) {
    dp[i] = add(dp[i / 2], item[i]);
    if (i == lim) {
      break;
    }
  }

  const usize q = scan<usize>();

  for (const usize loop : rep(0, q)) {
    usize v = scan<usize>();
    const u64 L = scan<u64>();
    std::vector<item_t> a;
    a.push_back(item_t({0, 0}));
    while (v >= lim) {
      a = add(a, item[v]);
      v /= 2;
    }
    u64 ans = 0;
    for (const auto &e : a) {
      if (e.w > L) {
        break;
      }
      const u64 rem = L - e.w;
      const auto itr =
          std::partition_point(dp[v].begin(), dp[v].end(),
                               [&](const auto &d) { return d.w <= rem; });
      if (itr == dp[v].begin()) {
        break;
      }
      chmax(ans, e.v + std::prev(itr)->v);
    }
    std::cout << ans << eoln;
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 166988