#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll inf=1e18;
int main()
{
	ios_base::sync_with_stdio(false);
	int n;
	cin>>n;
	vector<vector<int>> T(n+n+5);
	vector<vector<pair<int,ll>>> tmp(n+n+5),G(n+n+5);
	auto addedge=[&](int u,int v,ll w,int ty=1)
	{
//		cerr<<"addedge "<<u<<' '<<v<<' '<<w<<endl;
		G[u].emplace_back(v,w);
		G[v].emplace_back(u,w);
		if(ty)
		{
			T[u].push_back(v);
			T[v].push_back(u);
		}
	};
	for(int i=2;i<=n;i++)
	{
		int p;
		ll c;
		cin>>p>>c;
		tmp[p].emplace_back(i,c);
	}
	vector<int> lf;
	int ind=n;
	for(int i=1;i<=n;i++)
	{
//		cerr<<"split "<<i<<' '<<tmp[i].size()<<endl;
		if(tmp[i].empty())lf.push_back(i);
		else
		{
			int now=i;
			while(tmp[i].size()>2u)
			{
				auto [v,w]=tmp[i].back();
				tmp[i].pop_back();
				addedge(now,v,w);
				addedge(now,++ind,0);
				now=ind;
			}
			addedge(now,tmp[i][0].first,tmp[i][0].second);
			if(tmp[i].size()>1u)addedge(now,tmp[i][1].first,tmp[i][1].second);
		}
	}
	n=ind;
	int lcnt=(int)lf.size();
	for(int i=0;i<lcnt;i++)
	{
		ll c;
		cin>>c;
		addedge(lf[i],lf[(i+1)%lcnt],c,0);
	}
//	cerr<<"read graph end"<<endl;
	int q;
	cin>>q;
	vector<ll> ans(q+5,inf);
	vector<tuple<int,int,int>> qu;
	for(int i=1;i<=q;i++)
	{
		int u,v;
		cin>>u>>v;
		qu.emplace_back(u,v,i);
	}
	vector<ll> dis(n+5,inf);
	vector<int> good(n+5);
	auto dijk=[&](int s,int fl)
	{
		priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
		dis[s]=0;
		pq.emplace(0,s);
		while(not pq.empty())
		{
			auto [d,u]=pq.top();pq.pop();
			if(dis[u]!=d)continue;
			for(auto [v,w]:G[u])
			{
				if(good[v]==fl and dis[v]>dis[u]+w)
				{
					dis[v]=dis[u]+w;
					pq.emplace(dis[v],v);
				}
			}
		}
	};
	auto deledge=[&](int u,int v)
	{
//		cerr<<"delete edge "<<u<<' '<<v<<endl;
		for(auto it=G[u].begin();it!=G[u].end();++it)
		{
			if(it->first==v)
			{
				G[u].erase(it);
				break;
			}
		}
		for(auto it=G[v].begin();it!=G[v].end();++it)
		{
			if(it->first==u)
			{
				G[v].erase(it);
				break;
			}
		}
	};
	dijk(lf[0],0);
	for(auto [u,v,id]:qu)
	{
		ans[id]=min(ans[id],dis[u]+dis[v]);
	}
	deledge(lf[0],lf[lcnt-1]);
	
	vector<int> used(n+5),siz(n+5),mxson(n+5),vis(n+5),bel(n+5);
	vector<int> subs;
	int gcnt=0;
	function<void(int)> dfs0=[&](int u)
	{
//		cerr<<"dfs0 "<<u<<endl;
		siz[u]=1;mxson[u]=0;
		vis[u]=1;
		subs.push_back(u);
		for(auto v:T[u])
		{
			if(not used[v] and not vis[v])
			{
				dfs0(v);
				siz[u]+=siz[v];
				if(siz[v]>siz[mxson[u]])
					mxson[u]=v;
			}
		}
	};
	function<void(int,int)> dfs1=[&](int r,int u)
	{
		siz[u]=1;mxson[u]=0;
		vis[u]=0;
		for(auto v:T[u])
		{
			if(not used[v] and vis[v])
			{
				if(u==r)bel[v]=v;
				else bel[v]=bel[u];
				dfs1(r,v);
				siz[u]+=siz[v];
			}
		}
	};
	function<void(int,vector<tuple<int,int,int>>)> Divide=[&](int u,vector<tuple<int,int,int>> curq)
	{
//		cerr<<"Divide "<<u<<endl;
		subs.clear();
		dfs0(u);
		int r=u,sz=siz[u];
//		cerr<<"go "<<r<<' '<<siz[r]<<' '<<mxson[r]<<' '<<siz[mxson[r]]<<endl;
		while(mxson[r] and siz[mxson[r]]>=(sz+1)/2)
		{
			r=mxson[r];
		}
//		cerr<<"G="<<r<<endl;
		bel[r]=0;
		dfs1(r,r);
		++gcnt;
		vector<pair<int,int>> sp;
		for(auto x:subs)
		{
//			cerr<<x<<' '<<bel[x]<<endl;
			good[x]=gcnt;
			dis[x]=inf;
			if(x==r)continue;
			for(auto [y,w]:G[x])
			{
				if(x<y and bel[x]!=bel[y])
					sp.emplace_back(x,y);
			}
		}
		dijk(r,gcnt);
		for(auto [a,b,c]:curq)
		{
			ans[c]=min(ans[c],dis[a]+dis[b]);
//			cerr<<"upd "<<a<<' '<<b<<' '<<dis[a]+dis[b]<<endl;
		}
		for(auto [x,y]:sp)
		{
			for(auto z:subs)
			{
				dis[z]=inf;
			}
			dijk(x,gcnt);
			for(auto [a,b,c]:curq)
			{
//				cerr<<"upd "<<a<<' '<<b<<' '<<dis[a]+dis[b]<<endl;
				ans[c]=min(ans[c],dis[a]+dis[b]);
			}
			deledge(x,y);
		}
		used[r]=1;
		for(auto v:T[r])
		{
			if(not used[v])
			{
				vector<tuple<int,int,int>> tmpq;
				for(auto [a,b,c]:curq)
				{
					if(bel[a]==v and bel[b]==v)
						tmpq.emplace_back(a,b,c);
				}
				Divide(v,tmpq);
			}
		}
	};
	Divide(1,qu);
	
	for(int i=1;i<=q;i++)
		cout<<ans[i]<<"\n";
	return 0;
}