import sequtils,bitops,strutils
proc r:any=stdin.readLine.parseInt
proc R:any=stdin.readLine.split.map parseInt
var
 n=r()
 E=newSeqWith n:newSeq[int]()
 A=E
 o:tuple[d:seq[int],p:seq[seq[int]],n,m:int]
for _ in 0..<n-1:(let t=R();E[t[0]]&=t[1];E[t[1]]&=t[0])
proc i(e,w:int)=(for t in E[w]:(if t!=e:(A[w]&=t;i(w,t))))
i(-1,0)
E=A
block:
 var
  m=n.fastLog2+1
  d=newSeq[int]n
  p=newSeqWith m:newSeq[int]n
 proc fp(s,e,cd:int)=(p[0][s]=e;d[s]=cd;for t in E[s]:(if t!=e:fp t,s,cd+1))
 fp 0,-1,0
 for k in 0..<m-1:(for v in 0..<n:(if p[k][v]<0:p[k+1][v]= -1 else:p[k+1][v]=p[k][p[k][v]]))
 o=(d,p,n,m)
var
 C=newSeqWith n:r()
 I=newSeqWith n: -1
 a=0
proc x(u,v:int):int=
 var(u,v)=(u,v)
 if o.d[u]>o.d[v]:swap u,v
 for k in 0..<o.m:(if(((o.d[v]-o.d[u])shr k)and 1)!=0:v=o.p[k][v])
 if u==v:return u
 for k in(o.m-1).countdown(0):(if o.p[k][u]!=o.p[k][v]:(u=o.p[k][u];v=o.p[k][v]))
 return o.p[0][u]
proc ff(i,c:int)=(I[i]=C[i]+c;for t in E[i]:ff t,I[i])
ff 0,0
for _ in 0..<r():(let t=R();let p=x(t[0],t[1]);a+=(I[t[0]]+I[t[1]]-2*I[p]+C[p])*t[2])
echo a