#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

// abc014 D
struct node{
  int id,anc,dep,sum;
  vi kanc;
};
bool operator==(node l,node r){
  return l.id==r.id&&l.anc==r.anc&&l.dep==r.dep;
}
bool operator!=(node l,node r){
  return !(l==r);
}

int n;
vi g[125252];
int u[125252];
node nodes[125252];
bool used[125252];

int main(){
  // lca
  // doubling
  scanf("%d",&n);
  REP(i,n-1){
    int a,b;
    scanf("%d%d",&a,&b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  REP(i,n){
    scanf("%d",u+i);
  }
  queue<int> q;
  q.push(0);
  used[0] = true;
  nodes[0].anc = -1;
  nodes[0].dep = 0;
  nodes[0].kanc.push_back(-1);
  nodes[0].sum = u[0];
  while(!q.empty()){
    int i = q.front(); q.pop();
    REP(j,g[i].size()){
      int k = g[i][j];
      if(used[k])continue;
      used[k] = true;
      q.push(k);
      nodes[k].id = k;
      nodes[k].anc = i;
      nodes[k].dep = nodes[i].dep+1;
      nodes[k].kanc.push_back(i);
      nodes[k].sum = u[k] + nodes[i].sum;
      int iter = 0;
      while(nodes[k].kanc[iter]!=-1){
        int id = nodes[k].kanc[iter];
        if(nodes[id].kanc.size() <= iter)nodes[k].kanc.push_back(-1);
        else nodes[k].kanc.push_back(nodes[id].kanc[iter]);
        ++iter;
      }
    }
  }
  // query
  int m;
  scanf("%d",&m);
  ll ans = 0;
  while(m--){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    node l=nodes[a],r=nodes[b];
    if(l.dep > r.dep)swap(l,r);
    int sub = r.dep - l.dep;
    int k = 0;
    while(sub){
      if(sub&1==1) r = nodes[r.kanc[k]];
      ++k;
      sub>>=1;
    }
    while(r.anc!=l.anc && r!=nodes[l.anc] && l!=nodes[r.anc]){
      k = 0;
      while(r.kanc[k]!=l.kanc[k] && r.kanc[k]!=-1)++k;
      --k;
      r = nodes[r.kanc[k]];
      l = nodes[l.kanc[k]];
    }
    if(r!=l){
      if(r.anc==-1)r=nodes[l.anc];
      else r=nodes[r.anc];
    }
    // DEBUG(a);
    // DEBUG(b);
    // DEBUG(r.id);
    // DEBUG(nodes[a].sum);
    // DEBUG(nodes[b].sum);
    // DEBUG(r.sum);
    // DEBUG(u[r.id]);
    // DEBUG(nodes[a].sum + nodes[b].sum - r.sum + u[r.id]);
    ans += (ll)(nodes[a].sum + nodes[b].sum - 2*r.sum + u[r.id])*(ll)c;
  }
  printf("%lld\n",ans);
  return 0;
}