#include<bits/stdc++.h>
using namespace std;
const int N=3e6+10,B=20;
int n,I,U;
struct node
{
	long long vl[N],u1[N],u2[N];
	int Z;
	pair<int,int>ask(int d,int k)
	{
		long long v1=vl[d		]-vl[d+U/2	],
				  v2=vl[d+U/2	]-vl[d+U	];
		int r =(k&U-1),z=k-r;
		if(r<U/2)
		{
			v1-=vl[d+U+z]-vl[d+k+1+U];
			v1-=vl[d+k+1]-vl[d+U/2+z];
			v2-=vl[d+U/2+z]-vl[d+U+z];
		}
		else
		{
			v1-=vl[d+z+U]-vl[d+z+U/2+U];
			v2-=vl[d+z+U/2+U]-vl[d+k+1+U];
			v2-=vl[d+k+1]-vl[d+U+z];
		}
		return make_pair(v1,v2);
	}
	void shrink(int W)
	{
		while(Z>W)
		{
			if(Z>U)u2[Z-U]+=u2[Z];
			u1[Z]+=u2[Z];u1[Z-1]+=u1[Z];
			vl[Z]+=u1[Z];u1[Z]=u2[Z]=0;--Z;
		}
	}
	void ins(int d,int v){Z=max(Z,d),u2[d]+=v;}
}V,C;
vector<pair<int,int>>Q[N];
vector<int>to[N];
int v[N],w[N],dep[N];
long long ans[N];
void ins(int d,int v){V.ins(d,v>>I&1),C.ins(d,1);}
void shrink(int W){V.shrink(W),C.shrink(W);}
long long ask(int d,int k)
{
	auto k1=V.ask(d,k),k2=C.ask(d,k);
	return (k1.first+k2.second-k1.second)<<I;
}
int task[N],cnt;
namespace Z
{
	long long s[N],x[N];int Z;
	long long ask(int d,int k){return s[d]-s[d+k+1];}
	void shrink(int W)
	{
		while(Z>W){x[Z-1]+=x[Z];s[Z]+=x[Z];x[Z]=0;--Z;}
	}
	void ins(int d,int v){Z=max(Z,d),x[d]+=v;}
}
void pre(int u,int f,int D)
{
	task[++cnt]=u;dep[u]=D;
	for(auto k:Q[u])ans[k.second]-=Z::ask(D,min(k.first,n-D));
	Z::ins(D,w[u]);
	for(int v:to[u])pre(v,u,D+1);
	Z::shrink(D-1);
	for(auto k:Q[u])ans[k.second]+=Z::ask(D,min(k.first,n-D));
	task[++cnt]=-u;
}
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	cin>>n;for(int i=1;i<=n;++i)cin>>v[i],w[i]=v[i]>>B<<B,v[i]-=w[i];
	for(int i=2,u;i<=n;++i)cin>>u,to[u].push_back(i);
	int q;cin>>q;for(int i=1,x,k;i<=q;++i)cin>>x>>k,Q[x].emplace_back(k,i); 
	pre(1,0,1);
	for(int i=0;i<B;++i)
	{
		#define mem(z) memset(V.z,0,sizeof V.z);memset(C.z,0,sizeof C.z)
		mem(vl);mem(u1);mem(u2);V.Z=C.Z=0;
		I=i,U=(1<<I+1);
		for(int i=1;i<=cnt;++i)
		{
			int u=task[i],D=dep[abs(u)];
			if(u>0)
			{
				for(auto k:Q[u])ans[k.second]-=ask(D,min(k.first,n-D));
				ins(D,v[u]);
			}
			else
			{
				u=-u;shrink(D-1);
				for(auto k:Q[u])ans[k.second]+=ask(D,min(k.first,n-D));
			}
		}
	}
	for(int i=1;i<=q;++i)cout<<ans[i]<<"\n";
}