#include <iostream>
#include <vector>
using namespace std;
const int N = 1e6 + 6;
typedef long long ll;
int x, k;
ll a[N];
int f[N];
vector<int> son[N];
ll ans = 0;
void dfs(int x, int d) {
    if (d > k) return;
    ans += a[x] ^ d;
    if (d == k) return;
    for (auto i : son[x]) {
        dfs(i, d + 1);
    }
}
int main() {
    freopen("tree.in", "r", stdin);
    freopen("tree.out", "w", stdout);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 2; i <= n; i++) {
        cin >> f[i];
        son[f[i]].push_back(i);
    }
    int q;
    cin >> q;
    while (q--) {
        cin >> x >> k;
        ans = 0;
        dfs(x, 0);
        cout << ans << endl;
    }
    return 0;
}