#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int N = 1e6 + 10;
const int M = 20;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n, a[N], p[N], mdep[N], mson[N], dep[N], bfn[N], bn, rev[N], pre[N][M], cnt[N], down[N], lst[N], cur[N], son[N][M], f[N][M];
vector <int> e[N];

signed main() {
  n = read();
  rep(i, 1, n) a[i] = read();
  rep(i, 2, n) {
    p[i] = read();
    // cout << p[i] << ' ' << i << endl;
    e[p[i]].emplace_back(i);
  }
  rep(i, 1, n) mdep[i] = -1;
  drep(i, n, 1) {
    mdep[p[i]] = max(mdep[p[i]], ++ mdep[i]);
    sort(e[i].begin(), e[i].end(), [&](int u, int v) {
      return mdep[u] < mdep[v];
    });
    if (e[i].size()) mson[i] = e[i].back();
  }
  auto bfs = [&](int s = 1) {
    queue <int> q;
    q.push(s);
    while (q.size()) {
      int u = q.front(); q.pop();
      bfn[u] = ++ bn, rev[bfn[u]] = u;
      f[u][0] = f[cur[dep[u]]][0] + a[u];
      cnt[u] = cnt[cur[dep[u]]] + 1;
      rep(i, 0, M - 1) {
        pre[u][i] = pre[cur[dep[u]]][i] + (a[u] >> i & 1);
      }
      lst[u] = cur[dep[u]], cur[dep[u]] = u;
      for (int v : e[u]) {
        dep[v] = dep[u] + 1;
        q.push(v);
      }
    }
  } ;
  bfs();
  rep(u, 1, n) {
    son[u][0] = u;
    cnt[u] += cnt[p[u]];
    rep(i, 0, M - 1) pre[u][i] += pre[p[u]][i];
  }
  drep(u, n, 1) {
    down[u] = down[mson[u]] ? down[mson[u]] : u;
  }
  // pa(p, 1, n);
  // pa(mson, 1, n);
  // pa(lst, 1, n);
  // rep(u, 1, n) cout << f[u][0] << ' ';
  // cout << endl;
  // rep(u, 1, n) cout << pre[u][0] << ' ';
  // cout << endl;
  rep(i, 1, 19) drep(u, n, 1) {
    son[u][i] = son[mson[son[u][i - 1]]][i - 1];
    if (!son[u][i]) continue;
    f[u][i] = f[u][i - 1] + f[mson[son[u][i - 1]]][i - 1];
    int c = pre[son[u][i]][i - 1] - pre[son[u][i - 1]][i - 1];
    f[u][i] += (cnt[son[u][i]] - cnt[son[u][i - 1]] - 2 * c) << i - 1;
    // cout << "i, u, c, f = " << i << ' ' << u << ' ' << c << ' ' << f[u][i] << endl;
    // pv(son[u][i]);
  }
  for (int q = read(); q; -- q) {
    auto ask = [&](int u, int d) {
      if (!u) return 0ll;
      // cout << "----- ask u, d = " << u << ' ' << d << endl;
      d = min(d, dep[down[u]] - dep[u]);
      ++ d;
      int res = 0;
      drep(i, 19, 0) if (d >> i) {
        // cout << "u, i, f[u][i] = " << u << ' ' << i << ' ' << f[u][i] << endl;
        res += f[u][i], u = mson[son[u][i]], d ^= 1 << i;
        if (!u || !i) break;
        int c = pre[down[u]][i] - pre[p[u]][i];
        res += (cnt[down[u]] - cnt[p[u]] - 2 * c) << i;
        // cout << "u, i, c, res = " << u << ' ' << i << ' ' << c << ' ' << res << endl;
      }
      return res;
    } ;
    int u = read(), d = read();
    int res = ask(u, d) - ask(lst[u], min(d, dep[down[u]] - dep[u]));
    // pv(ask(u, d));
    // pv(ask(lst[u], d));
    printf("%lld\n", res);
  }
  return 0;
}