#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 1000005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,h[N],cnt,a[N],d[N],ans,x,y,z,k;
struct edge{int v,n;}e[N];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void dfs1(int u,int f)
{
	d[u]=d[f]+1;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v==f)continue;
		dfs1(v,u);
	}
}
void dfs2(int rt,int u,int f)
{
	ans+=(d[u]-d[rt])^a[u];
	if(d[u]-d[rt]>=k)return;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v==u)continue;
		dfs2(rt,v,u);
	}
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("tree.in","r",stdin);freopen("tree.out","w",stdout);
	n=read();fo(i,1,n)a[i]=read();
	fo(i,2,n)ad(read(),i);
	dfs1(1,0);
	m=read();
	while(m--)
	{
		x=read();k=read();
		ans=0;dfs2(x,x,0);
		printf("%lld\n",ans); 
	}
	return 0;
}