from collections import deque
import sys
input=sys.stdin.readline

J=19

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

T=[None]*(N+1)
A=[[1]*(N+1) for _ in range(J)]
Depth=[None]*(N+1)

Q=deque([1])
T[1]=0
Depth[1]=0


while Q:
    v=Q.popleft()
    for x in E[v]:
        u=x%N+1
        w=x//N

        if T[u]==None:
            T[u]=T[v]+w
            Depth[u]=Depth[v]+1

            A[0][u]=v
            Q.append(u)

for p in range(J-1):
    for u in range(1,N+1):
        v=A[p][u]
        A[p+1][u]=A[p][v]

def upper(u,k):
    i=0
    while k>0:
        if k%2==1:
            u=A[i][u]
        i+=1
        k//=2
    return u

def lca(u,v):
    x=Depth[u]
    y=Depth[v]
    u=upper(u,max(x-y,0))
    v=upper(v,max(y-x,0))

    if u==v:
        return u

    for j in range(J-1,-1,-1):
        X=A[j]
        if X[u]!=X[v]:
            u=X[u]
            v=X[v]

    return A[0][u]

Q=int(input())
for i in range(Q):
    u,v=map(int,input().split())
    print(T[u]+T[v]-2*T[lca(u,v)])