#!/usr/bin/ python3.8
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

N = int(readline())
graph = [[] for _ in range(N + 1)]
for _ in range(N - 1):
    a, b = map(int, readline().split())
    a += 1
    b += 1
    graph[a].append(b)
    graph[b].append(a)

cost = (0,) + tuple(int(readline()) for _ in range(N))
Q = int(readline())
ABM = np.array(read().split(), np.int64)
A = ABM[::3] + 1
B = ABM[1::3] + 1
M = ABM[2::3]


def EulerTour(graph, root=1):
    V = len(graph)
    par = [0] * V
    depth = [0] * V
    dist = [0] * V
    dist[1] = cost[1]
    depth[root] = 0
    tour = [root]
    st = [root]
    while st:
        x = st[-1]
        if not graph[x]:
            st.pop()
            tour.append(par[x])
            continue
        y = graph[x].pop()
        if y == par[x]:
            continue
        par[y] = x
        depth[y] = depth[x] + 1
        dist[y] = dist[x] + cost[y]
        st.append(y)
        tour.append(y)
    return par, tour, depth, dist


par, tour, depth, dist = EulerTour(graph)

Ltour = len(tour)
tour_arr = np.array(tour)
depth_arr = np.array(depth)
tour_d = depth_arr[tour_arr]
idx = np.arange(len(depth))
idx[tour_arr] = np.arange(Ltour)

sp = np.empty((Ltour.bit_length(), Ltour), np.int32)
sp[0] = np.arange(Ltour)
for n in range(1, Ltour.bit_length()):
    prev, width = sp[n - 1], 1 << (n - 1)
    x = prev[:-width]
    y = prev[width:]
    condition = tour_d[x] > tour_d[y]
    sp[n] = prev
    sp[n, :-width][condition] = y[condition]


def LCA(A, B):
    AB = np.vstack([A, B]).T
    LR = idx[AB]
    LR.sort(axis=1)
    # [L,R] におけるRmQ
    L = LR[:, 0]
    R = LR[:, 1]
    x = R - L
    n = np.zeros_like(x)  # 2^n <= R-L
    for _ in range(20):
        x >>= 1
        n[x > 0] += 1
    x = sp[n, L]
    y = sp[n, R - (1 << n) + 1]
    return np.where(tour_d[x] < tour_d[y], tour_arr[x], tour_arr[y])


C = LCA(A, B)
dist = np.array(dist)
cost = np.array(cost)
answer = ((dist[A] + dist[B] - 2 * dist[C] + cost[C]) * M).sum()
print(answer)