def main():
    import sys
    input = sys.stdin.readline

    # min
    def STfunc(a, b):
        if a < b:
            return a
        else:
            return b

    # クエリは0-indexedで[l, r)
    class SparseTable():
        def __init__(self, A):
            # A: 処理したい数列
            self.N = len(A)
            self.K = self.N.bit_length() - 1
            self.table = [[0] * (self.K + 1) for _ in range(self.N)]
            for i, a in enumerate(A):
                self.table[i][0] = A[i]
            for k in range(1, self.K + 1):
                for i in range(self.N):
                    j = i + (1 << (k - 1))
                    if j <= self.N - 1:
                        self.table[i][k] = STfunc(self.table[i][k - 1], self.table[j][k - 1])
                    else:
                        self.table[i][k] = self.table[i][k - 1]

        def query(self, l, r):
            # [l, r)の最小値を求める
            k = (r - l).bit_length() - 1
            return STfunc(self.table[l][k], self.table[r - (1 << k)][k])

    # adj[0] must be empty list
    def EulerTour(adj, root):
        st = [root]
        ret = []
        seen = [0] * len(adj)
        par = [0] * len(adj)
        depth = [0] * len(adj)
        dist_from_root = [0] * len(adj)
        while st:
            v = st.pop()
            if seen[v]:
                ret.append(v)
                continue
            ret.append(v)
            seen[v] = 1
            if par[v] != 0:
                st.append(par[v])
            for u in adj[v]:
                if seen[u] == 0:
                    st.append(u)
                    par[u] = v
                    depth[u] = depth[v] + 1
                    dist_from_root[u] = dist_from_root[v] + weight[v*(N+1)+u]

        return ret, depth, dist_from_root

    N = int(input())
    adj = [[] for _ in range(N+1)]
    weight = {}
    for i in range(N-1):
        u, v, w = map(int, input().split())
        u += 1
        v += 1
        adj[u].append(v)
        adj[v].append(u)
        weight[u*(N+1)+v] = w
        weight[v*(N+1)+u] = w

    et, depth, dist_from_root = EulerTour(adj, 1)
    depth_list = [0] * len(et)
    left = [-1] * (N + 1)
    right = [-1] * (N + 1)
    for i, v in enumerate(et):
        depth_list[i] = depth[v] * (N+1) + v
        if left[v] < 0:
            left[v] = i
        right[v] = i
    ST = SparseTable(depth_list)

    def dist(a, b):
        lca_info = ST.query(min(left[a], left[b]), max(right[a], right[b]) + 1)
        lca_depth, lca_v = divmod(lca_info, N+1)
        return dist_from_root[a] + dist_from_root[b] - dist_from_root[lca_v]*2

    for _ in range(int(input())):
        x, y, z = map(int, input().split())
        x += 1
        y += 1
        z += 1
        print((dist(x, y) + dist(y, z) + dist(z, x)) // 2)


if __name__ == '__main__':
    main()