#include<bits/stdc++.h>
using namespace std;
int n;
#define ll long long
ll w_[300100],W[601000];
int U[601000],V[600100],m;
bool vis[600100];
vector<int>G[300100],g[601000];
#define pb push_back
int rk[601000],z,be[601000];
ll wo[600100];
int sk[600100],N;
void add(int u,int v){U[++m]=u,V[m]=v,W[m]=((v<=n)?w_[v]:0);g[u].pb(m),g[v].pb(m);}
int build(int l,int r){
	if(l==r)return sk[l];
	int mid=(l+r)>>1,ls=build(l,mid),rs=build(mid+1,r),u=++N;
	add(u,ls),add(u,rs);return u;
}
void dfs(int x){
	if(G[x].empty()){rk[x]=++z,be[z]=x;return;}
	int gg=0;for(int v:G[x])sk[gg++]=v;
	int rt=build(0,gg-1);
	add(x,rt);
	for(int v:G[x])dfs(v);
}
int sz[601010],S,M,rr;
void dfs2(int x,int f){
	sz[x]=1;
	for(int i:g[x])if(!vis[i]){
		int v=U[i]^V[i]^x;
		if(v==f)continue;
		dfs2(v,x),sz[x]+=sz[v];
		if(M>max(sz[v],S-sz[v]))
			M=max(sz[v],S-sz[v]),rr=i;
	}
}
int A[251000],B[251000];
ll ans[251000];
#define vi vector<int>
vi fz,P;
void dfs3(int x,int f){
	sz[x]=1;
	fz.pb(x);
	for(int i:g[x])if(!vis[i]){
		int v=U[i]^V[i]^x;if(v==f)continue;
		dfs3(v,x),sz[x]+=sz[v];
	}
}
int is[250100];
#define fi first
#define se second
const ll I=1e18;
ll de[250100][2],dis[250100];
bool vio[250100];
void dij(int s,int op){
	priority_queue<pair<ll,int> >Q;
	for(int x:P)dis[x]=I,vio[x]=0;
	dis[s]=0,Q.push({0,s});
	while(!Q.empty()){
		int u=Q.top().se;Q.pop();
		if(vio[u])continue;vio[u]=1;
		for(int i:g[u]){
			int v=U[i]^V[i]^u;if(!is[v])continue;
			if(dis[v]>dis[u]+W[i])
			dis[v]=dis[u]+W[i],Q.push({-dis[v],v}); 
		}
		if(!rk[u])continue;
		for(int p=-1;p<=1;p++){
			int v=be[(rk[u]+p+z-1)%z+1];
			ll w=((p==1)?wo[rk[u]]:wo[rk[v]]);
			if(!is[v])continue;
			if(dis[v]>dis[u]+w)dis[v]=dis[u]+w,Q.push({-dis[v],v});
		}
	}
	for(int x:P)de[x][op]=dis[x];
}
void sol(int e,vi Q){
	vi ou,ov;
	vis[e]=1;
	dfs3(U[e],0);ou=fz,fz.clear();
	dfs3(V[e],0);ov=fz,fz.clear();
	P.clear();
	for(int x:ou)P.pb(x),is[x]=1;for(int x:ov)P.pb(x),is[x]=2;
	vector<pair<pair<int,int>,ll> >Z;
	Z.pb({{U[e],V[e]},W[e]});
	for(int x:P)if(rk[x]&&is[x]!=is[be[rk[x]%z+1]]&&is[be[rk[x]%z+1]])Z.pb({{x,be[rk[x]%z+1]},wo[rk[x]]});
	for(auto it:Z){
		int u=it.fi.fi,v=it.fi.se;
		dij(u,0),dij(v,1);
		for(int o:Q){
			for(int h=0;h<2;h++)
				ans[o]=min(ans[o],de[A[o]][h]+de[B[o]][h^1]+it.se);
		}
	}
	vi q1,q2;
	for(int o:Q)if(is[A[o]]==is[B[o]]){
		if(is[A[o]]==1)q1.pb(o);
		else q2.pb(o); 
	}
	for(int x:ou)is[x]=0;for(int x:ov)is[x]=0;
	if(sz[U[e]]>1)S=sz[U[e]],M=S+1,dfs2(U[e],0),sol(rr,q1);
	if(sz[V[e]]>1)S=sz[V[e]],M=S+1,dfs2(V[e],0),sol(rr,q2);
}
int main(){
	scanf("%d",&n);
	for(int i=2,f;i<=n;i++)
	scanf("%d%lld",&f,&w_[i]),G[f].pb(i);
	N=n,dfs(1);
	for(int i=1;i<=z;i++)scanf("%lld",&wo[i]);
	int q;scanf("%d",&q);
	vi Q;
	for(int i=1;i<=q;i++)scanf("%d%d",&A[i],&B[i]),ans[i]=I,Q.pb(i);
	S=N,M=S+1,dfs2(1,0),sol(rr,Q);
	for(int i=1;i<=q;i++)printf("%lld\n",ans[i]);
	return 0;
}