#include<bits/stdc++.h>
#define ll long long
#define rep(i, x, y) for(int i = (x), stOyny = (y); i <= stOyny; ++i)
#define irep(i, x, y) for(int i = (x), stOyny = (y); i >= stOyny; --i)
#define pb emplace_back
#define vint vector<int>
#define let const auto
#define fi first
#define se second
#define il inline
#define ci const int
#define all(S) S.begin(), S.end()
#define Size(S) S.size()
ll read() {
	ll res = 0, flag = 1; char c = getchar();
	while(c < '0' || c > '9') { if(c == '-') flag = -1; c = getchar(); }
	while(c >= '0' && c <= '9') res = res * 10 + c - '0', c = getchar();
	return res * flag;
}
using namespace std;
template<typename T>
il void tmax(T &x, const T y) { if(x < y) x = y; }
template<typename T>
il void tmin(T &x, const T y) { if(x > y) x = y; }
const int N = 2.5e5 + 20;
vector<pair<int, ll>> G[N];
vint Gedge[N], Tr[N];
int n;
namespace buildgraph {
	vector<pair<int, ll>> Tin[N];
	vint vec;
	int cnt;
	void adde(int u, int v, ll w, bool op) {
		if(op) Tr[v].pb(u), Tr[u].pb(v);
		else Gedge[v].pb(u), Gedge[u].pb(v);
		G[u].pb(v, w), G[v].pb(u, w);
	}
	void dfs(int u) {
		if(Tin[u].empty()) vec.pb(u);
		int lst = u;
		for(auto [v, w] : Tin[u])
			adde(lst, ++cnt, 0, true), adde(lst = cnt, v, w, true), dfs(v);
	}
	void Main() {
		cnt = n = read();
		rep(i, 2, n) {
			int fa = read();
			Tin[fa].pb(i, read());
		}
		dfs(1);
		n = cnt;
		vec.pb(vec[0]);
		rep(i, 0, Size(vec) - 2) adde(vec[i], vec[i + 1], read(), false);
	}
}

int col[N], sz[N];
ll ans[N];
using vtuple = vector<tuple<int, int, int>>;
void partition(int tmproot, int nsz, const vtuple &quer) {
	static int col[N], sz[N], vtim[N];
	static bool ban[N];
	int rt = 0;
	vint vec;
	auto findrt = [&](auto self, int u, int faz) -> void {
		vec.pb(u);
		sz[u] = 1;
		for(int v : Tr[u]) if(v != faz && !ban[v]) self(self, v, u), sz[u] += sz[v];
		if(!rt || min(sz[u], nsz - sz[u]) > min(sz[rt], nsz - sz[rt])) rt = u;
	};
	findrt(findrt, tmproot, 0);
	ban[rt] = true;
	vint stp = {rt};
	auto dfs = [&](auto self, int u, int nc, int faz) -> void {
		col[u] = nc, vtim[u] = rt;
		for(int v : Gedge[u]) if(vtim[v] == rt && col[u] != col[v]) stp.pb(u); 
		for(int v : Tr[u]) if(v != faz && !ban[v]) self(self, v, nc, u);
	};
	vtim[rt] = rt, col[rt] = 0;
	for(int x : Tr[rt]) if(!ban[x]) dfs(dfs, x, x, rt);
	for(auto [id, u, v] : quer) for(int x : {u, v}) assert(vtim[x] == rt);
	static ll dis[N];
	auto dijkstra = [&](int st) {
		for(int x : vec) dis[x] = -1;
		priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pr;
		pr.emplace(dis[st] = 0, st);
		while(!pr.empty()) {
			auto [nd, u] = pr.top();
			pr.pop();
			if(dis[u] != nd) continue;
			for(auto [v, w] : G[u]) if(vtim[v] == rt)
				if(dis[v] == -1 || dis[v] > nd + w) pr.emplace(dis[v] = nd + w, v);
		}
		for(auto [id, u, v] : quer) tmin(ans[id], dis[u] + dis[v]);		
	};
	for(int st : stp) dijkstra(st);
	for(int x : Tr[rt]) if(!ban[x]) {
		vtuple nv;
		nv.reserve(quer.size());
		for(auto [id, u, v] : quer) if(col[u] == x && col[v] == x) nv.pb(id, u, v);
		partition(x, sz[x], nv);
	}
}
signed main() {
//	freopen("1.in", "r", stdin);
	memset(ans, 0x3f, sizeof(ans));
	buildgraph::Main();
	int Q = read();
	vtuple quer;
	rep(i, 1, Q) {
		int u = read(), v = read();
		quer.pb(i, u, v);
	}
	partition(1, n, quer);
	rep(i, 1, Q) cout << ans[i] << '\n';
	return 0;
}