#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=1e6+5,B=30;
int n,q,fa[N],a[N],dep[N],in[N],out[N],dfn;
vector<int> son[N],depv[N];
vector<ll> sumA[N];
vector<int> cntB[N][B+1];
int id[N];
ll pre[N][B+1][2];
bool chain;
void dfs(int x) {
	in[x]=++dfn;
	id[dfn]=x;
	depv[dep[x]].push_back(dfn);
	for(int i=0; i<son[x].size(); i++) {
		int y=son[x][i];
		dep[y]=dep[x]+1;
		dfs(y);
	}
	out[x]=dfn;
}
int main() {
	freopen("tree.in","r",stdin);
	freopen("tree.out","w",stdout);
	scanf("%d",&n);
	for(int i=1; i<=n; i++)scanf("%d",&a[i]);
	for(int i=2; i<=n; i++)scanf("%d",&fa[i]);
	chain=1;
	for(int i=2; i<=n; i++)if(fa[i]!=i-1) {
			chain=0;
			break;
		}
	if(chain) {
		vector<ll> sumA(n+1,0);
		vector<vector<ll>> cnt1(B+1,vector<ll>(n+1,0));
		vector<vector<ll>> bit1(B+1,vector<ll>(n+1,0));
		for(int i=1; i<=n; i++) {
			sumA[i]=sumA[i-1]+a[i];
			for(int j=0; j<=B; j++) {
				cnt1[j][i]=cnt1[j][i-1]+(((i-1)>>j)&1);
				bit1[j][i]=bit1[j][i-1]+((((i-1)>>j)&1)&((a[i]>>j)&1));
			}
		}
		scanf("%d",&q);
		while(q--) {
			int x,k;
			scanf("%d%d",&x,&k);
			int r=min(x+k,n);
			int len=r-x+1;
			ll ans=sumA[r]-sumA[x-1];
			for(int j=0; j<=B; j++) {
				ll cnt=cnt1[j][r]-cnt1[j][x-1];
				ll sumb=bit1[j][r]-bit1[j][x-1];
				ans+=(1ll<<j)*(cnt-2*sumb);
			}
			printf("%lld\n",ans);
		}
		return 0;
	}
	for(int i=2; i<=n; i++)son[fa[i]].push_back(i);
	dep[1]=0;
	dfs(1);
	for(int d=0; d<=n; d++) {
		if(depv[d].empty())continue;
		sort(depv[d].begin(),depv[d].end());
		int sz=depv[d].size();
		sumA[d].resize(sz+1,0);
		for(int b=0; b<=B; b++)cntB[d][b].resize(sz+1,0);
		for(int i=0; i<sz; i++) {
			int y=id[depv[d][i]];
			sumA[d][i+1]=sumA[d][i]+a[y];
			for(int b=0; b<=B; b++)cntB[d][b][i+1]=cntB[d][b][i]+((a[y]>>b)&1);
		}
	}
	scanf("%d",&q);
	while(q--) {
		int x,k;
		scanf("%d%d",&x,&k);
		ll ans=0;
		for(int d=0; d<=k; d++) {
			int h=dep[x]+d;
			if(h>n||sumA[h].empty())continue;
			int L=lower_bound(depv[h].begin(),depv[h].end(),in[x])-depv[h].begin();
			int R=upper_bound(depv[h].begin(),depv[h].end(),out[x])-depv[h].begin()-1;
			if(L>R)continue;
			int sz=R-L+1;
			ll s=sumA[h][R+1]-sumA[h][L];
			int cb[B+1];
			for(int b=0; b<=B; b++)cb[b]=cntB[h][b][R+1]-cntB[h][b][L];
			ll add=s;
			for(int b=0; b<=B; b++)if((d>>b)&1)add+=(1ll*sz-2*cb[b])*(1ll<<b);
			ans+=add;
		}
		printf("%lld\n",ans);
	}
	return 0;
}