#include #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++) #define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++) #define codefor int test;scanf("%d",&test);while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define yes(ans) if(ans)printf("yes\n");else printf("no\n") #define Yes(ans) if(ans)printf("Yes\n");else printf("No\n") #define YES(ans) if(ans)printf("YES\n");else printf("NO\n") #define popcount(v) __builtin_popcount(v) #define vector2d(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) using namespace std; using ll = long long; template using rpriority_queue = priority_queue, greater>; const int MOD=1000000007; const int MOD2=998244353; const int INF=1<<30; const ll INF2=1LL<<60; void scan(int& a){scanf("%d",&a);} void scan(long long& a){scanf("%lld",&a);} templatevoid scan(pair& p){scan(p.first);scan(p.second);} templatevoid scan(tuple& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));} template void scan(T& a){cin>>a;} template void scan(vector& vec){for(auto&& it:vec)scan(it);} void in(){} template void in(Head& head, Tail&... tail){scan(head);in(tail...);} void print(const int& a){printf("%d",a);} void print(const long long& a){printf("%lld",a);} void print(const double& a){printf("%.15lf",a);} templatevoid print(const pair& p){print(p.first);putchar(' ');print(p.second);} template void print(const T& a){cout< void print(const vector& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}} void out(){putchar('\n');} template void out(const T& t){print(t);putchar('\n');} template void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);} template void dprint(const T& a){cerr< void dprint(const vector& vec){if(vec.empty())return;cerr< void debug(const T& t){dprint(t);cerr< void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);} ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;} ll updivide(ll a,ll b){return (a+b-1)/b;} template void chmax(T &a,const T b){if(b>a)a=b;} template void chmin(T &a,const T b){if(b> g; vector> parent; vector depth; const vector& operator[](int i) const { return g[i]; } vector& operator[](int i) { return g[i]; } LCA_tree() : _n(0) {} LCA_tree(int n) : _n(n), g(n),depth(n) { MAX_LOG_V=1; while(_n>>MAX_LOG_V)MAX_LOG_V++; parent.resize(MAX_LOG_V,vector(_n)); } void merge(int u,int v){ g[u].push_back(v); g[v].push_back(u); } void dfs(int v,int p,int d){ parent[0][v]=p; depth[v]=d; for(int i=0;idepth[v])swap(u,v); for(int i=0;i>i&1)v=parent[i][v]; } if(u==v)return u; for(int i=MAX_LOG_V-1;i>=0;i--){ if(parent[i][u]!=parent[i][v]){ u=parent[i][u]; v=parent[i][v]; } } return parent[0][u]; } //パスの辺数 int dist(int u,int v){ int lcav=lca(u,v); if(lcav==-1)return depth[u]+depth[v]; return depth[u]+depth[v]-2*depth[lcav]; } //頂点wが頂点u,vのパス上に存在するか int on_path(int u,int v,int w){ return (dist(u,w)+dist(v,w)==dist(u,v)); } }; int main(){ INT(n); LCA_tree g(n); int u,v,c; ll ans=0,sumv=0; rep(i,n-1){ in(u,v); g.merge(u,v); } vector cnt(n,0),a(n); in(a); g.init(0); INT(m); rep(i,m){ in(u,v,c); cnt[u]+=c; cnt[v]+=c; int lcav=g.lca(u,v); cnt[lcav]-=2*c; ans+=c*a[lcav]; } function dfs=[&](int v,int p){ sumv+=a[v]; ans+=sumv*cnt[v]; for(auto u:g[v]){ if(u==p)continue; dfs(u,v); } sumv-=a[v]; }; dfs(0,-1); out(ans); }