#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
import numpy as np

# %%
N = int(readline())
UVW = tuple(tuple(map(int, readline().split()) for _ in range(N - 1)))
Q = int(readline())
XYZ = np.array(read().split(), np.int64) + 1
X = XYZ[::3]
Y = XYZ[1::3]
Z = XYZ[2::3]


# %%
G = [[] for _ in range(N + 1)]
for u, v, w in UVW:
    G[u + 1].append((v + 1, w))
    G[v + 1].append((u + 1, w))


# %%
def EulerTour(graph, root=1):
    V = len(graph)
    par = [0] * V
    depth = [0] * V
    weight = [0] * V
    depth[root] = 0
    tour = [root]
    st = [root]
    while st:
        x = st[-1]
        if not graph[x]:
            st.pop()
            tour.append(par[x])
            continue
        y, c = graph[x].pop()
        if y == par[x]:
            continue
        par[y] = x
        depth[y] = depth[x] + 1
        weight[y] = weight[x] + c
        st.append(y)
        tour.append(y)
    return par, tour, depth, weight


# %%
par, tour, depth, weight = EulerTour(G)


# %%
Ltour = len(tour)
tour_arr = np.array(tour)
depth_arr = np.array(depth)
tour_d = depth_arr[tour_arr]
idx = np.arange(len(depth))
idx[tour_arr] = np.arange(Ltour)

# %%
sp = np.empty((Ltour.bit_length(), Ltour), np.int32)
sp[0] = np.arange(Ltour)
for n in range(1, Ltour.bit_length()):
    prev, width = sp[n - 1], 1 << (n - 1)
    x = prev[:-width]
    y = prev[width:]
    condition = tour_d[x] > tour_d[y]
    sp[n] = prev
    sp[n, :-width][condition] = y[condition]


# %%
def LCA(A, B):
    AB = np.vstack([A, B]).T
    LR = idx[AB]
    LR.sort(axis=1)
    # [L,R] におけるRmQ
    L = LR[:, 0]
    R = LR[:, 1]
    x = R - L
    n = np.zeros_like(x)  # 2^n <= R-L
    for _ in range(20):
        x >>= 1
        n[x > 0] += 1
    x = sp[n, L]
    y = sp[n, R - (1 << n) + 1]
    return np.where(tour_d[x] < tour_d[y], tour_arr[x], tour_arr[y])


# %%
XY = LCA(X, Y)
XZ = LCA(X, Z)
YZ = LCA(Z, Y)


# %%
A = np.array(weight)
answer = A[X] + A[Y] + A[Z] - A[XY] - A[XZ] - A[YZ]
print('\n'.join(answer.astype(str)))