#include<bits/stdc++.h>
//ign V fir bit
#pragma GCC diagnostic ignored "-Wc++17-extensions"
#define int long long
using namespace std;
const int maxn = 2e6+10, lm = __lg(maxn)+1;

struct{int nxt,v;}edge[maxn<<1];
int head[maxn],ec;
void add(int u,int v){edge[++ec]={head[u],v};head[u]=ec;}

int n,Q,V[maxn];

int son[maxn],dfn[maxn],dfc;
int dfs1(int u){
	int len=0;
	for(int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].v,vl=dfs1(v);
		if(vl>len)len=vl,son[u]=v;
	} return len+1;
}
int cnt1[maxn][lm],cnt0[maxn][lm], f[maxn][lm], othbit[maxn];
struct QRY{int id,k;};vector<QRY>q[maxn];
int ans[maxn];
int dfs2(int u){
	// infun(u);
	int buf=dfn[u]=++dfc,pr=0,res=dfc;
	if(son[u])pr=dfc+1,res=dfs2(son[u]);
	// else ++dfc;
	for(int i=head[u];i;i=edge[i].nxt){
		int v=edge[i].v;if(v!=son[u]){
			int cur=dfc,las=dfs2(v);
			for(int j=cur+1;j<=las;++j) {
				for(int k=0;k<lm;++k)
					cnt1[buf+j-cur][k]+=cnt1[j][k],
					cnt0[buf+j-cur][k]+=cnt0[j][k],
					f[buf+j-cur][k]+=f[j][k];
				othbit[buf+j-cur]+=othbit[j];
			}
		}
	}
	for(int i=0;i<lm;++i)cnt1[buf][i]=cnt1[pr][i]+(V[u]>>i&1),
						cnt0[buf][i]=cnt0[pr][i]+(~V[u]>>i&1);
	othbit[buf]=othbit[pr]+(V[u]>>lm);
	// deb(buf,arr(cnt1[buf]-1,lm));

	for(int i=0;i<lm;++i) {
		int ed = buf+(1<<i) > res ? 0 : buf+(1<<i);
		int pred = buf+(1<<(i-1)) > res ? 0 : buf+(1<<(i-1));
		f[buf][i] = ((cnt1[buf][i] - cnt1[ed][i])<<i)
					+ (i? f[buf][i-1]+f[pred][i-1]
						+((cnt0[pred][i-1]-cnt0[ed][i-1])<<(i-1))
						-((cnt1[pred][i-1]-cnt1[ed][i-1])<<(i-1)) :0);
		// deb(f[buf][i]);
		// deb(((cnt1[buf][i] - cnt1[ed][i])<<i));
		if(!i)continue;
		// deb(f[buf+(1<<(i-1))][i-1]);
		// deb(((cnt0[buf+(1<<(i-1))][i-1]-cnt0[ed][i-1])<<(i-1)));
		// deb(((cnt1[buf+(1<<(i-1))][i-1]-cnt1[ed][i-1])<<(i-1)));
	}
	for(auto[id,k]:q[u]){
		// infun(id,k);
		int va=0,cur=buf;k=min(k,res-buf)+1;
		int ed=(buf+k-1==res?0:buf+k);
		for(int i=lm-1;~i;--i){
			// deb(i,cur);
			if(k>>i&1){
				// deb("BinGO!"_,f[cur][i]);
				va += f[cur][i];
				cur+=1<<i;
				// deb("and then:"_,((cnt0[cur==res+1?0:cur][i]-cnt0[ed][i])<< i));
				va += ((cnt0[cur==res+1?0:cur][i]-cnt0[ed][i])<< i);
			}else{
				// deb("only then:"_,((cnt1[cur==res+1?0:cur][i]-cnt1[ed][i])<< i));
				va += ((cnt1[cur==res+1?0:cur][i]-cnt1[ed][i]) << i);
			}
			// deb(va);

		} ans[id]=va+othbit[buf]-othbit[ed];
	}

	// deb(res);

	return res;
}



signed main() {
	// freopen("pai.in","r",stdin);
	// freopen("pai.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n;for(int i=1;i<=n;++i)cin>>V[i];
	for(int i=2,f;i<=n;++i)cin>>f,add(f,i);
	cin>>Q;for(int i=1,x,k;i<=Q;++i)
		cin>>x>>k,q[x].push_back({i,k});
	dfs1(1),dfs2(1);
	for(int i=1;i<=Q;++i)cout<<ans[i]<<'\n';
}