import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto edges = new long[2][][](N);
	foreach (i; 0..N-1)
	{
		auto u = RD;
		auto v = RD;
		auto w = RD;
		edges[u] ~= [v, w];
		edges[v] ~= [u, w];
	}
	auto rank = new long[](N);
	auto par = new long[2][](N);
	void dfs(long pos, long r, long last, long w)
	{
		//debug writeln(pos, " ", r, " ", last, " ", w);
		rank[pos] = r;
		par[pos] = [last, w];
		foreach (e; edges[pos])
		{
			if (e[0] == last) continue;
			dfs(e[0], r+1, pos, e[1]);
		}
	}
	dfs(0, 0, -1, 0);

	auto Q = RD;
	auto ans = new long[](Q);
	foreach (i; 0..Q)
	{
		auto x = RD;
		auto y = RD;
		auto z = RD;
		auto xr = rank[x];
		auto yr = rank[y];
		auto zr = rank[z];
		long[long] set;
		while (!(x == y && y == z))
		{
			if (xr >= yr && xr >= zr)
			{
				auto p = par[x];
				set[x*(10^^6)+p[0]] = p[1];
				x = p[0];
				--xr;
			}
			else if (yr >= xr && yr >= zr)
			{
				auto p = par[y];
				set[y*(10^^6)+p[0]] = p[1];
				y = p[0];
				--yr;
			}
			else
			{
				auto p = par[z];
				set[z*(10^^6)+p[0]] = p[1];
				z = p[0];
				--zr;
			}
		}
		foreach (key; set.keys)
			ans[i] += set[key];
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush();
	debug readln();
}