#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
const int M=401000;
const int L=35;
typedef pair<ll,int> PLI;
int n,m,T;
vector<array<ll,3>> E[N],e[N];
PII pe[M],comp[N][L];
VI rt[N*5];
ll dis[N][L][3];
int ss[N],col[N],del[N];

namespace dijk{
	ll dis[N];
	int vis[N];
	priority_queue<PLI,vector<PLI>,greater<PLI>> hs;
	const ll inf=1ll<<60;
	void solve(int S,VI vtot) {
		for (auto x:vtot) dis[x]=inf,vis[x]=0;
		dis[S]=0;
		hs.push(mp(dis[S],S));
		while (!hs.empty()) {
			int u=hs.top().se; hs.pop();
			if (vis[u]) continue;
			vis[u]=1;
			for (auto [v,w,id]:E[u]) if (!del[id]) {
				if (dis[v]>dis[u]+w) {
					dis[v]=dis[u]+w;
					hs.push(mp(dis[v],v));
				}
			}
		}
	}
}


void solve(int u,int sz,int lev) {
	//printf("? %d %d %d\n",u,sz,lev);
	if (sz==1) return;
	int ms=sz+1,me=-1;
	++T;
	function<void(int,int)> dfs1=[&](int u,int par) {
		ss[u]=1;
		for (auto [v,w,id]:e[u]) {
			if (v==par) continue;
			if (del[id]) continue;
			dfs1(v,u);
			ss[u]+=ss[v];
			int msz=max(ss[v],sz-ss[v]);
			if (msz<ms) ms=msz,me=id;
		}
	};
	VI re;
	dfs1(u,-1);
	assert(me!=-1);
	//printf("me %d\n",me);
	auto [pu,pv]=pe[me];
	VI vu,vv,vtot;
	int cc=1;
	function<void(int,int)> dfs2=[&](int u,int par) {
		vu.pb(u);
		vtot.pb(u);
		col[u]=cc;
		comp[u][lev]=mp(T,cc);
		for (auto [v,w,id]:e[u]) {
			if (v==par) continue;
			if (del[id]) continue;
			dfs2(v,u);
		}
	};
	dfs2(pv,pu); vv=vu; vu.clear();
	cc=0; dfs2(pu,pv);
	for (auto u:vu) for(auto [v,w,id]:E[u]) {
		if (del[id]) continue;
		assert(comp[v][lev].fi==T);
		if (col[v]!=col[u]) {
			re.pb(id);
			//printf("dd %d %d %d\n",id,u,v);
		}
	}
	set<int> tt;
	for (auto x:re) tt.insert(pe[x].fi);
	rt[T]=VI(all(tt));
	int pc=0;
	for (auto x:rt[T]) {
		dijk::solve(x,vtot);
		for (auto y:vtot) dis[y][lev][pc]=dijk::dis[y];
		++pc;
	}
	for (auto x:re) {
		//printf("del %d\n",x);
		del[x]=1;
	}
	solve(pu,SZ(vu),lev+1);
	solve(pv,SZ(vv),lev+1);
}

int eid,nn,p[N];
VI son[N];
ll c[N];
void add(int x,int y,ll w) {
	++eid;
	e[x].pb({y,w,eid});
	e[y].pb({x,w,eid});
	E[x].pb({y,w,eid});
	E[y].pb({x,w,eid});
	pe[eid]=mp(x,y);
}
int main() {
	scanf("%d",&n);
	rep(i,2,n+1) {
		scanf("%d%lld",&p[i],&c[i]);
		son[p[i]].pb(i);
	}
	int nn=n;
	rep(i,1,n+1) {
		int ps=i;
		rep(j,0,SZ(son[i])) {
			int v=son[i][j];
			add(ps,v,c[v]);
			if (j!=SZ(son[i])-1) {
				add(ps,++nn,0);
				ps=nn;
			}
		}
	}
	VI lef;
	rep(i,1,n+1) if (son[i].empty()) {
		lef.pb(i);
	}
	rep(i,0,SZ(lef)) {
		ll v;
		scanf("%lld",&v);
		int x=lef[i],y=lef[(i+1)%SZ(lef)];
		++eid;
		pe[eid]=mp(x,y);
		E[x].pb({y,v,eid});
		E[y].pb({x,v,eid});
	}
	//rep(i,1,eid+1) printf("edges %d %d %d\n",i,pe[i].fi,pe[i].se);
	solve(1,nn,0);
	int q;
	scanf("%d",&q);
	rep(i,0,q) {
		int x,y;
		scanf("%d%d",&x,&y);
		ll ans=1ll<<60;
		int lev=0;
		while (comp[x][lev].fi==comp[y][lev].fi&&comp[x][lev].fi!=0) {
			int tt=comp[x][lev].fi;
			rep(j,0,SZ(rt[tt])) ans=min(ans,dis[x][lev][j]+dis[y][lev][j]);
			++lev;
		}
		printf("%lld\n",ans);
	}
}