import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')





type SegTree = object
  tree :seq[int]
  index:seq[int]
  n:int

proc initSegTree(baseArr:seq[int]):SegTree=
  var n = baseArr.len
  var m = 1
  while m < n:
    m*=2
  result = SegTree()
  result.n = m
  result.tree = newseqwith(2*m-1,int.high.div(4))
  result.index = newseqwith(2*m-1,int.high.div(4))
  for i, v in baseArr:
    result.tree[m-1+i]=v
    result.index[m-1+i]=i
  for idx in countdown(m-2,0):
    if result.tree[idx*2+1] <= result.tree[idx*2+2]:
      result.tree[idx] = result.tree[idx*2+1]
      result.index[idx] = result.index[idx*2+1]
    else:
      result.tree[idx] = result.tree[idx*2+2]
      result.index[idx] = result.index[idx*2+2]

proc get(segTree:SegTree,ql,qr:int,k:int=0,left:int=0,right:int= -1):(int,int)=
  var right=right
  if right<0:
    right = segTree.n
  #echo ql,", ", qr, ", ",left,", ", right
  if ql>=right or qr<=left:
    return (int.high,-1)
  if ql <= left and right <= qr:
    return (segTree.tree[k],segTree.index[k])
  var
    vl = segTree.get(ql,qr,2*k+1,left,(left+right).div(2))
    vr = segTree.get(ql,qr,2*k+2,(left+right).div(2),right)
  return min(vl,vr)

proc set(segTree:var SegTree,idx,value:int)=
  var k = segTree.n - 1 + idx
  segTree.tree[k] = value
  while k>=1:
    k = (k-1).div(2)
    if segTree.tree[k] == min(segTree.tree[2*k+1],segTree.tree[2*k+2]):
      break
    else:
      if segTree.tree[2*k+1] <= segTree.tree[2*k+2]:
        segTree.tree[k] = segTree.tree[2*k+1]
        segTree.index[k] = segTree.index[2*k+1]
      else:
        segTree.tree[k] = segTree.tree[2*k+2]
        segTree.index[k] = segTree.index[2*k+2]



proc solve()=
  var
    n = scan()
    es = newseqwith(n,newseq[int]())
    cs = newseqwith(n,newseq[int]())
    depth = newseq[int]()
    inter = newseqwith(n,int.high)
    outer = newseqwith(n,0)
    weights = newseqwith(1,0)
    cumWeight:seq[int]
    fp = newseq[int]()
    segTree:SegTree
  
  for i in 0..<n-1:
    var
      (a,b,c) = (scan(),scan(),scan())
    es[a].add(b)
    es[b].add(a)
    cs[a].add(c)
    cs[b].add(c)
  var
    q = scan()
    xyz = newseqwith(q,@[scan(),scan(),scan()].sorted())

  proc LCA(a,b:int):int=
    var
      left = min(inter[a],inter[b])
      right = max(inter[a],inter[b])
      (dpt, index) = segTree.get(left,right+1)
    return index
  
  proc pathLength(a,b:int):int=
    var
      left = min(inter[a],inter[b])
      right = max(inter[a],inter[b])
    return weights[right]-weights[left]

  # 
  proc eulTour(par:int,p:int,dpt:int)=
    inter[p].min=depth.len
    depth.add(dpt)
    fp.add(p)
    for (nxt,cost) in zip(es[p],cs[p]):
      if par==nxt:continue
      weights.add(cost)
      eulTour(p,nxt,dpt+1)
      fp.add(p)
      depth.add(dpt)
      weights.add(-cost)
    outer[p].max=depth.len
  eulTour(-1,0,0)
  #echo fp
  #echo depth
  for i in 1..<weights.len:
    weights[i]+=weights[i-1]
  #echo weights
  #echo inter
  #echo outer
  segTree = fp.initSegTree()
  #echo fp[LCA(3,4)]
  #echo fp[LCA(3,5)]
  #echo fp[LCA(5,6)]
  #echo pathLength(0,4)
  #echo pathLength(1,4)
  #echo pathLength(0,6)
  for v in xyz:
    var
      res = int.high.div(4)
      ptwo:int
      pthree:int
      v = v
      
    ptwo = fp[LCA(v[0],v[1])]
    pthree = fp[LCA(v[2],ptwo)]
    res = pathLength(ptwo,v[0])+pathLength(ptwo,v[1]) + pathLength(pthree,ptwo) + pathLength(pthree,v[2])
    while v.nextPermutation():
      ptwo = fp[LCA(v[0],v[1])]
      pthree = fp[LCA(v[2],ptwo)]
      res.min=pathLength(ptwo,v[0])+pathLength(ptwo,v[1]) + pathLength(pthree,ptwo) + pathLength(pthree,v[2])
    echo res
    


  


  
solve()