#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<vector<pii>> g(N);
	REP(i, N - 1) {
		int a, b, c;
		scanf("%d %d %d", &a, &b, &c);
		--a; --b;
		g[a].emplace_back(b, c);
		g[b].emplace_back(a, c);
	}
	
	vector par(18, vector<int>(N, -1));
	vector<int> dist(N), depth(N);
	
	auto dfs = [&](auto self, int u) -> void {
		for (auto [v, d] : g[u]) if (v != par[0][u]) {
			dist[v] = dist[u] + d;
			depth[v] = depth[u] + 1;
			par[0][v] = u;
			self(self, v);
		}
	};
	
	par[0][0] = 0;
	dfs(dfs, 0);
	
	FOR(i, 1, 18) REP(j, N) par[i][j] = par[i - 1][par[i - 1][j]];
	
	int Q;
	cin >> Q;
	while (Q--) {
		int s, t;
		scanf("%d %d", &s, &t);
		--s; --t;
		
		if (depth[s] < depth[t]) swap(s, t);
		
		const int d = depth[s] - depth[t];
		int a = s, b = t;
		REP(i, 18) if (d >> i & 1) a = par[i][a];
		int lca;
		if (a == b) lca = a;
		else {
			for (int i = 17; i >= 0; --i) if (par[i][a] != par[i][b]) a = par[i][a], b = par[i][b];
			lca = par[0][a];
		}
		int ans = dist[s] - 2 * dist[lca] + dist[t];
		printf("%d\n", ans);
	}
}