import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


class LCA:
    def __init__(self, N, E, root=0):
        self.N = N
        self.E = E
        self.K = N.bit_length()
        self.par = [[-1 for _ in range(N)] for _ in range(self.K)]
        self.depth = [None] * N

        self.order = [None] * N
        self._cnt = 0

        self.cost = [0] * N

        self.dfs(root, 0, -1)
        for k in range(self.K - 1):
            for i in range(self.N):
                if self.par[k][i] < 0:
                    continue
                self.par[k + 1][i] = self.par[k][self.par[k][i]]

    def dfs(self, v, d, p):
        self.par[0][v] = p
        self.depth[v] = d
        self.order[v] = self._cnt
        self._cnt += 1

        for c, dest in self.E[v]:
            if dest == p:
                continue
            self.cost[dest] = self.cost[v] + c
            self.dfs(dest, d + 1, v)

    def lca(self, u, v):
        if self.depth[u] > self.depth[v]:
            u, v = v, u
        d = self.depth[v] - self.depth[u]
        for k in range(self.K):
            if d & (1 << k):
                v = self.par[k][v]

        if u == v:
            return u
        for k in range(self.K)[::-1]:
            if self.par[k][u] != self.par[k][v]:
                u = self.par[k][u]
                v = self.par[k][v]
        return self.par[0][v]

    def dist(self, u, v):
        return self.cost[u] + self.cost[v] - 2 * self.cost[self.lca(u, v)]


N = int(input())
E = [[] for _ in range(N)]
for _ in range(N - 1):
    u, v, w = map(int, input().split())
    E[u].append((w, v))
    E[v].append((w, u))
solver = LCA(N, E)

Q = int(input())
for _ in range(Q):
    x, y, z = map(int, input().split())
    # xo, yo, zo = solver.order[x], solver.order[y], solver.order[z]
    # x, y, z = map(lambda x: x[0], sorted([(x, xo), (y, yo), (z, zo)], key=lambda x: x[1]))
    print((solver.dist(x, y) + solver.dist(y, z) + solver.dist(z, x)) // 2)