# include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const int N = 2e5 + 5; 
int n;
struct edge
{
	int v, w; 
};
struct node
{
	int u, v; i64 w; 
	node() {}
	node(int _u, int _v, i64 _w) : u(_u), v(_v), w(_w) {}
}Eg; int sizS = 0, mindelt = 1e9;
struct Query
{
	int l, id;
};
vector <Query> Q[N];
bool compare(const struct node &x, const struct node &y)
{
	return x.v < y.v;
}
vector <node> Pts;
vector <edge> g[N]; 
vector<pair<i64, int> > L, R; 
bool del[N]; int siz[N];

void find_rt(int x, int fa)
{
	siz[x] = 1;
	for(auto I : g[x])
	{
		int v = I.v; 
		if(v == fa || del[v]) continue;
		find_rt(v, x); 
		siz[x] += siz[v];
		int dt = abs(siz[v] - (sizS - siz[v]));
		if(dt < mindelt) mindelt = dt, Eg = {x, v, I.w};
	}
	return;
}

void dfs(int x, int fa, i64 DIST, vector <pair <i64,int> > &A)
{
	A.push_back({DIST, x});
	for(auto I : g[x])
	{
		int v = I.v; 
		if(v == fa || del[v]) continue;
		dfs(v, x, DIST + 1ll * I.w, A);
	}
	return;
}
void solve(node Ed)
{
	// printf("solve : (%d,%d,%lld)\n", Ed.u, Ed.v, Ed.w);
	L.clear(), R.clear();
	set <pair<int, i64> > St;
	dfs(Ed.u, Ed.v, 0, L);
	dfs(Ed.v, Ed.u, 0, R);

	del[Ed.u] = del[Ed.v] = 1;
	sort(L.begin(), L.end()), sort(R.begin(), R.end());
	for(int i = 0, j = 0; i < (int)L.size(); i++)
	{
		while(j < (int)R.size() && R[j].first <= L[i].first) St.insert({R[j].second, R[j].first}), ++j;
		auto it = St.upper_bound({L[i].second, 0}); 
		if(it != St.end()) Pts.push_back({L[i].second, (*it).first, (*it).second + L[i].first + Ed.w});
		if(it != St.begin())
		{
			--it;
			Pts.push_back({(*it).first, L[i].second, (*it).second + L[i].first + Ed.w});
		}
	}
	St.clear();
	for(int i = 0, j = 0; i < (int)R.size(); i++)
	{
		while(j < (int)L.size() && L[j].first <= R[i].first) St.insert({L[j].second, L[j].first}), ++j; 
		auto it = St.upper_bound({R[i].second, 0});
		if(it != St.end()) Pts.push_back({R[i].second, (*it).first, (*it).second + R[i].first + Ed.w});
		if(it != St.begin())
		{
			--it;
			Pts.push_back({(*it).first, R[i].second, (*it).second + R[i].first + Ed.w});
		}
	}
	int lstR = (int)R.size(); 
	Eg = {-1, -1, -1}, sizS = (int)L.size(), mindelt = 1e9; 
	if(sizS >= 2) find_rt(Ed.u, Ed.v), solve(Eg); 
	Eg = {-1, -1, -1}, sizS = lstR, mindelt = 1e9; 
	if(sizS >= 2) find_rt(Ed.v, Ed.u), solve(Eg); 
	return;
}

struct SgT
{
	struct node
	{
		i64 Max, tag; 
	}T[N << 2];
	void build(int root, int l, int r)
	{
		T[root].Max = 1e15, T[root].tag = -1;
		if(l == r) return;
		int mid = (l + r) >> 1;
		build(root << 1, l, mid), build(root << 1 | 1, mid + 1, r);
		return;
	}
	void pushup(int root)
	{
		T[root].Max = max(T[root << 1].Max, T[root << 1 | 1].Max);
		return;
	}
	void pushdown(int root)
	{
		if(T[root].tag == -1) return; 
		i64 tag = T[root].tag; T[root].tag = -1;
		T[root << 1].Max = tag;
		T[root << 1].tag = tag;
		T[root << 1 | 1].Max = tag;
		T[root << 1 | 1].tag = tag;
		return;
	}
	void update(int root, int l, int r, int s, int t, i64 d)
	{
		if(l <= s && t <= r)
		{
			T[root].Max = T[root].tag = d; return;
		}
		pushdown(root);
		int mid = (s + t) >> 1;
		if(l <= mid) update(root << 1, l, r, s, mid, d);
		if(r > mid) update(root << 1 | 1, l, r, mid + 1, t, d); 
		pushup(root);
		return;
	}
	int query(int root, int l, int r, i64 d) // the Max x that ax > d
	{
		// printf("root = %d, l = %d, r = %d, d = %lld\n", root, l, r, d);
		if(l == r) 
		{
			return T[root].Max <= d ? -1 : l;
		}
		pushdown(root);
		int mid = (l + r) >> 1;
		// printf("lfMax = %lld\n", T[root << 1].Max);
		return T[root << 1].Max <= d ? query(root << 1 | 1, mid + 1, r, d) : query(root << 1, l, mid, d);
	}
	i64 query2(int root, int l, int r, int x)
	{
		if(l == r) return T[root].Max;
		pushdown(root);
		int mid = (l + r) >> 1;
		return (x <= mid) ? query2(root << 1, l, mid, x) : query2(root << 1 | 1, mid + 1, r, x);
	}
	void modify(int l, i64 d)
	{
		// printf("modify : l = %d, d = %lld\n", l, d);
		// [1, l] Max(d, ai)
		int pos = query(1, 1, n, d); 
		// printf("pos = %d\n", pos);
		if(pos == -1 || pos > l) return;
		update(1, pos, l, 1, n, d);
		// printf("update : %d, %d, %lld\n", pos, l, d);
		return;
	}
}T;
i64 Ans[N];
int main(void)
{
	scanf("%d", &n);
	for(int i = 1; i < n; i++)
	{
		int u, v, w; scanf("%d%d%d", &u, &v, &w);
		g[u].push_back({v, w}), g[v].push_back({u, w}); 
	}
	Eg = {-1, -1, -1}, mindelt = 1e9, sizS = n; find_rt(1, 0); solve(Eg); 
	for(auto &I : Pts) if(I.u > I.v) swap(I.u, I.v);
	sort(Pts.begin(), Pts.end(), compare);
	// printf("DEBUG Pts\n");
	// for(auto I : Pts) 
	// {
	// 	printf("%d %d %lld\n", I.u, I.v, I.w);
	// }
	int Test; scanf("%d", &Test);
	for(int i = 1; i <= Test; i++)
	{
		int l, r; scanf("%d%d", &l, &r); 
		if(l != r) Q[r].push_back({l, i});
		else Ans[i] = -1;
	}
	T.build(1, 1, n);
	for(int r = 1, j = 0; r <= n; r++)
	{
		// printf("r = %d\n", r);
		while(j < (int)Pts.size() && Pts[j].v == r) T.modify(Pts[j].u, Pts[j].w), ++j;
		for(auto I : Q[r]) 
		{
			Ans[I.id] = T.query2(1, 1, n, I.l);
		}
	}
	for(int i = 1; i <= Test; i++) printf("%lld\n", Ans[i]);
	return 0;
}