#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
#define clz __builtin_clz
#define ctz __builtin_ctz
#define sgn(x) ((x)&1?-1:1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tiii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;
 
int read() {
	int x=0,w=1; char c=getchar(); 
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
	return x*w;
}

const int N=1e6+9;

int n,m,tick,yc[N],c[N],fa[N],h[N],len[N],son[N],id[N],s[N][33],f[N][29],ans[N],top[N],bl[N],tag[N][33];
vi e[N];
vp q[N];

void dfs1(int u) {
	for(int v:e[u]) {
		dfs1(v);
		if(h[v]+1>h[u]) h[u]=h[v]+1, son[u]=v;
	}
}
void dfs2(int u) {
	if(!top[u]) top[u]=u;
	id[u]=++tick; if(son[u]) top[son[u]]=top[u], dfs2(son[u]);
	for(int v:e[u]) if(v!=son[u]) top[v]=v, dfs2(v);
}

signed main() {
	n=read();
	rep(i,1,n) yc[i]=read();
	rep(i,2,n) fa[i]=read(), e[fa[i]].eb(i);
	dfs1(1), dfs2(1);
	rep(i,1,n) e[i].clear();
	rep(i,1,n) if(i!=son[fa[i]]) e[id[fa[i]]].eb(id[i]);
	rep(i,1,n) len[id[i]]=h[i]+1, c[id[i]]=yc[i], bl[id[i]]=top[i];
	m=read();
	rep(i,1,m) {
		int u=read(), k=read(), x=id[u];
		q[x].eb(k+1,i);
	}
	per(i,n,1) {
		rep(h,0,30) {
			if((c[i]>>h)&1) s[i][h]=(bl[i+1]==bl[i]?s[i+1][h]:0)-1;
			else s[i][h]=(bl[i+1]==bl[i]?s[i+1][h]:0)+1;
		}
	}
	per(i,n,1) {
		f[i][0]=c[i]; if(bl[i+1]==bl[i]) rep(h,0,30) s[i][h]+=(tag[i][h]=tag[i+1][h]);
		for(int j:e[i]) {
			rep(k,1,len[j]) rep(h,0,20) f[i+k][h]+=f[j+k-1][h];
			rep(k,1,len[j]) rep(h,0,30) s[i+k][h]+=s[j+k-1][h];
			rep(h,0,30) s[i][h]+=s[j][h], tag[i][h]+=s[j][h];
		}
		rep(h,1,20) if((1<<h)<=len[i]) {
			int ad=s[i+(1<<h-1)][h-1]-(bl[i+(1<<h)]==bl[i]?s[i+(1<<h)][h-1]:0);
			f[i][h]=f[i][h-1]+f[i+(1<<h-1)][h-1]+ad*(1<<h-1);
		} else f[i][h]=f[i][h-1];
		for(auto [k,id]:q[i]) {
			k=min(k,len[i]); int cur=0, j=i;
			per(h,20,0) if(j+(1<<h)<=i+k) {
				ans[id]+=f[j][h]; int tc=cur;
				while(tc) {
					int x=ctz(tc); tc^=(1<<x);
					int ad=s[j][x]-(bl[j+(1<<h)]==bl[j]?s[j+(1<<h)][x]:0);
					ans[id]+=ad*(1<<x);
				} j+=(1<<h), cur+=(1<<h);
			}
		}
	}
	rep(i,1,m) printf("%lld\n",ans[i]);
	return 0;
}