#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace IO{
	const int siz=1<<25;
	char a[siz],b[siz],*ia=a+siz,*ea=a+siz,*ib=b,*eb=b+siz;
	int p[105],l=0;
	inline char gc(){if (ia==ea) fread(a,1,siz,stdin),ia=a;return *ia++;}
	inline void flush(){fwrite(b,1,ib-b,stdout);ib=b;}
	inline void pc(char c){if (ib==eb) flush();*ib++=c;}
	inline int read(){
		int x=0;char t=gc();
		for (;t<'0' || t>'9';t=gc());
		for (;'0'<=t && t<='9';t=gc()) x=x*10+t-'0';
		return x;
	}
	inline void write(ll x){
		if (!x) pc('0');
		for (;x;x/=10) p[++l]=x%10;
		for (;l;--l) pc(p[l]+'0');pc('\n');
	}
	struct f{~f(){flush();}}F;
}
using IO::read;
using IO::write;
const int N=1e6+5;
const int B=20;
int head[N],go[N],nxt[N];
int last[N],ask_k[N],ask_id[N],lk[N];
int F[N],son[N],st[N],dep[N];
int a[N];
ll ans[N];
int n,m,tot=0,cnt=0;
void dfs(int x){
	F[x]=1;
	for (int i=head[x];i;i=nxt[i]){
		dep[go[i]]=dep[x]+1;
		dfs(go[i]);
		if (F[go[i]]+1>F[x]) F[x]=F[go[i]]+1,son[x]=go[i];
	}
}
void dfs1(int x){
	if (!st[x]) st[x]=cnt+1,cnt+=F[x];
	if (son[x]){
		st[son[x]]=st[x]+1;
		dfs1(son[x]);
	}
	for (int i=head[x];i;i=nxt[i])
		if (go[i]!=son[x])
			dfs1(go[i]);
}
int c[B][2][N];
int f[B][N][2];
int g[B][N];
ll s[N];
void add(int w,int v,int x,int y){
	for (;x<=n;x+=x&-x) c[w][v][x]+=y;
}
int get(int w,int v,int l,int r){
	int res=0;
	for (;r;r-=r&-r) res+=c[w][v][r];
	if (l)
		for (--l;l;l-=l&-l) res-=c[w][v][l];
	return res;
}
void add(int x,ll y){
	for (;x<=n;x+=x&-x) s[x]+=y;
}
ll get(int l,int r){
	ll res=0;
	for (;r;r-=r&-r) res+=s[r];
	for (--l;l;l-=l&-l) res-=s[l];
	return res;
}
ll calc(int x,int k){
	k=min(k,F[x]-1);
	ll res=0;
	for (int w=0;w<B;++w){
		int t=k/(1<<w+1);
		int c=g[w][st[x]]-g[w][st[x]+t*(1<<w+1)];
		int l=t*(1<<w+1),r=t*(1<<w+1)+(1<<w);//[l,r)
		if (l<k+1){
			r=min(r,k+1);
			c+=get(w,1,st[x]+l,st[x]+r-1);
		}
		l=t*(1<<w+1)+(1<<w),r=(t+1)*(1<<w+1);
		if (l<k+1){
			r=min(r,k+1);
			c+=get(w,0,st[x]+l,st[x]+r-1);
		}
		res+=1ll*(1<<w)*c;
	}
	res+=get(st[x],st[x]+k)*(1ll<<B);
//	if (k==F[x]-1) res+=(get()s[st[x]]<<B);
//	else res+=((s[st[x]]-s[st[x]+k+1])<<B);
	return res;
}
void dfs2(int x){
//	s[st[x]]+=(a[x]>>B);
	add(st[x],a[x]>>B);
	for (int w=0;w<B;++w){
		++f[w][st[x]][(a[x]>>w)&1];
		add(w,(a[x]>>w)&1,st[x],1);
	}
	if (son[x]) dfs2(son[x]);
	for (int i=head[x];i;i=nxt[i])
		if (go[i]!=son[x]){
			dfs2(go[i]);
			for (int w=0;w<B;++w)
				for (int j=0;j<F[go[i]];++j){
					f[w][st[x]+j+1][0]+=f[w][st[go[i]]+j][0];
					f[w][st[x]+j+1][1]+=f[w][st[go[i]]+j][1];
					add(w,0,st[x]+j+1,f[w][st[go[i]]+j][0]);
					add(w,1,st[x]+j+1,f[w][st[go[i]]+j][1]);
					g[w][st[x]+j+1]+=g[w][st[go[i]]+j];
				}
		}
	for (int w=0;w<B;++w){
		int l=0,r=(1<<w);
		if (l<F[x]){
			r=min(r,F[x]);
			g[w][st[x]]+=get(w,1,st[x]+l,st[x]+r-1);
		}
		l=(1<<w),r=(1<<w+1);
		if (l<F[x]){
			r=min(r,F[x]);
			g[w][st[x]]+=get(w,0,st[x]+l,st[x]+r-1);
		}
		if ((1<<w+1)<F[x])
			g[w][st[x]]+=g[w][st[x]+(1<<w+1)];
	}
	for (int i=last[x];i;i=lk[i])
		ans[ask_id[i]]=calc(x,ask_k[i]);
}
int main(){
	n=read();
	for (int i=1;i<=n;++i) a[i]=read();
	for (int x,i=2;i<=n;++i){
		x=read();
		++tot;go[tot]=i;nxt[tot]=head[x];head[x]=tot;
	}
	tot=0,m=read();
	for (int x,k,i=1;i<=m;++i){
		x=read(),k=read();
		++tot;ask_k[tot]=k;ask_id[tot]=i;lk[tot]=last[x];last[x]=tot;
	}
	dep[1]=1;dfs(1);
	dfs1(1);
	dfs2(1);
	for (int i=1;i<=m;++i) write(ans[i]);
	return 0;
}