#include <bits/stdc++.h>

#define LL long long

#define rep(i, s, t) for (register int i = (s), i##end = (t); i <= i##end; ++i)

#define dwn(i, s, t) for (register int i = (s), i##end = (t); i >= i##end; --i)

using namespace std;

inline int read() {

    int x = , f = ; char ch;

    for (ch = getchar(); !isdigit(ch); ch = getchar()) if (ch == '-') f = -f;

    for (; isdigit(ch); ch = getchar()) x =  * x + ch - '';

    return x * f;

}

const int maxn = ;

int n, q, lim;/*

vector<pair<int, int> > qs[maxn];

vector<int> G[maxn];*/

int qcd[maxn];

struct Chain {

    int head[maxn], nx[maxn], id[maxn], sz;

    Chain() {memset(head, , sizeof(head)); sz = ;}

    inline void AddItem(int pos, int Item, int other = -) {

        id[++sz] = Item;

        nx[sz] = head[pos];

        head[pos] = sz;

        if(~other) qcd[sz] = other;

    }

}qs, G;

LL ans[maxn], pool[maxn], *f[maxn], *now=pool+;

int a[maxn];

void print(int q, LL* ans, int lim) {

    LL res;

    for(int i = ; i <= q; ) {

        res = ;

        for(int j = i; j <= min(q, i + lim - ); j++) res ^= ans[j];

        i += lim;

        printf("%lld\n", res);

    }

    return ;

}

int mxs[maxn], mxd[maxn];

void dfs(int x) {

    mxd[x] = ;

    for(int i=G.head[x];i;i=G.nx[i]) {

        dfs(G.id[i]);

        mxd[x] = max(mxd[x], mxd[G.id[i]] + );

        if((mxd[G.id[i]] > mxd[mxs[x]])) mxs[x] = G.id[i];

    }

}

void solve(int x) {

    if(mxs[x]) {

        f[mxs[x]] = f[x] + ;

        solve(mxs[x]);

    }

    f[x][] = a[x];

    for(int i=G.head[x];i;i=G.nx[i]) {

        if(G.id[i] == mxs[x]) continue;

        f[G.id[i]] = now; now += mxd[G.id[i]] + ; solve(G.id[i]);

        rep(j, , mxd[G.id[i]]) f[x][j+] += f[G.id[i]][j];

        //cout << "to: " << to << " " << f[x][1] << endl;

    }

    //cout << x << " " << f[x][1] << endl;

    /*dwn(i, mxd[x]-1, 0) {

        cout << f[x][i] << " jiale " << f[x][i + 1] << endl;

        f[x][i] += f[x][i + 1];

    }*/

    f[x][] += f[x][];

    for(int i=qs.head[x];i;i=qs.nx[i]) {

        if(qs.id[i] > mxd[x]) ans[qcd[i]] = ;

        else ans[qcd[i]] = f[x][qs.id[i]];

    }/*

    if(qs[x].size()) {

    //    cout << "DEBUG: " << qs[x].first << " " << qs[x].second << " " << f[x][qs[x].first] << endl;

    //    if(qs[x].first > mxd[x]) ans[qs[x].second] = 0;

    //    else

        /*cout << "x: " << x << endl;

        rep(i, 0, mxd[x])

            cout << f[x][i] << " ";

        cout << endl;*/

    /*

        for(auto ii : qs[x]) {

            //cout << "DEBUG: " << ii.first << " " << mxd[x] << endl;

            if(ii.first > mxd[x]) ans[ii.second] = 0;

            else ans[ii.second] = f[x][ii.first];

        }

    }*/

}

int main() {

    n = read(); int x, y;

    rep(i, , n) a[i] = read();

    rep(i, , n) {

        //x = read(), G[x].push_back(i);

        x = read();

        G.AddItem(x, i);

    }

    q = read();

    rep(i, , q) {

        x = read(); y = read();

        //qs[x].push_back(make_pair(y, i));

        qs.AddItem(x, y, i);

    } mxd[] = -;

    dfs();

    f[] = now; now += mxd[] + ; solve();

    lim = read();

    print(q, ans, lim);

    //rep(i, 1, q) cout << ans[i] << endl;

}