#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 3e5 + 12, MOD = 1e9 + 7;

int n,timer,tin[N],tout[N];
ll dp[N][2];
vector<int> g[N];
int up[N][20];
int b = 20;
int s[N],pos[N];
void prec(int v,int pr = -1){
    s[v] = 1;
    for(int &to:g[v]) {
        if (to == pr) continue;
        prec(to, v);
        s[v] += s[to];
        if (s[to] > s[g[v].front()]) {
            swap(to, g[v].front());
        }
    }
}
int h[N],d[N],anc[N];

int _t = 1;
void prec1(int v, int pr = 0) {
    if(!h[v]){
        h[v] =v;
    }
    pos[v] = _t++;
    anc[v] = pr;
    for(int to:g[v]){
        if(to == pr) continue;
        if(to == g[v][0]){
            h[to] = h[v];
        }
        d[to] = d[v] + 1;
        prec1(to,v);
    }
}
void dfs(int v, int pr = 1) {
    tin[v] = ++timer;
    up[v][0] = pr;
    for(int i = 1;i < b;i++){
        up[v][i] = up[up[v][i - 1]][i - 1];
    }
    for(int to:g[v]){
        if(to != pr){
            dfs(to,v);
        }
    }
    tout[v] = ++timer;
}
bool is(int x,int y){
    return tin[x] <= tin[y] && tout[x] >= tout[y];
}
int lca(int v,int u){
    if(is(v,u)) return v;
    if(is(u,v)) return u;
    for(int i = b - 1;i >= 0;i--){
        if(!is(up[v][i],u)){
            v = up[v][i];
        }
    }
    return up[v][0];
}
int q;
ll res =0 ;
vector<array<int, 3>> qr[N];
ll t[N * 4];
void upd(int pos,ll val,int v = 1,int tl = 1,int tr = n){
    if(tl == tr){
        t[v] = val;
    }else{
        int tm = (tl + tr) >> 1;
        if(pos <= tm) upd(pos,val,v+v,tl,tm);
        else upd(pos,val,v+v+1,tm+1,tr);
        t[v] = t[v + v] + t[v + v + 1];
    }
}
ll get(int l,int r,int v = 1,int tl = 1,int tr = n){
    if(l > r || tl > r || l > tr) return 0;
    if(tl >= l && tr <= r) return t[v];
    int tm = (tl + tr) >> 1;
    return get(l,r,v + v,tl,tm) + get(l,r,v+v+1,tm+1,tr);
}
ll get1(int v, int u) {
    if(u == -1) return 0;
    ll ans = 0;
    while (true) {
        if (d[h[v]] < d[h[u]])
            swap(v, u);
        if (h[v] == h[u]) {
            if (pos[v] > pos[u]) swap(v, u);
            ans += get(pos[v], pos[u]);
            break;
        }
        else {
            ans += get(pos[h[v]], pos[v]);
            v = anc[h[v]];
        }
    }
    return ans;
}

void calc(int v,int pr = -1) {
    for (int to: g[v]) {
        if (to == pr)continue;
        calc(to, v);
        dp[v][0] += max(dp[to][0], dp[to][1]);
    }
    for (auto [x, y, c]: qr[v]) {
        ll S = 0;
        ll T = get(v,x) + get(v,y);
        auto proc = [&](int u) {
            if (u == -1) return;
            while(u != v){
                S += get(pos[u],pos[u]);
                u = up[u][0];
                continue;
                if(is(v,h[u])){
                    S += get(pos[h[u]],pos[v]);
                    u = anc[h[u]];
                }else{
                    S += get(pos[v],pos[u]);
                    break;
                }
            }
        };
        proc(x);
        proc(y);
        dp[v][1] = max(dp[v][1], S + c + dp[v][0]);
    }
    res = max({res,dp[v][1],dp[v][0]});
    upd(pos[v],dp[v][0] - max(dp[v][0],dp[v][1]));
}
void test(){
    cin >> n;
    for(int i = 1;i <= n - 1;i++){
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    prec(1);
    prec1(1);
    dfs(1);
    cin >> q;
    for(int i = 1;i <= q;i++){
        int x,y,c;
        cin >> x >> y >> c;
        int z = lca(x, y);
        if(z != x){
            swap(x,y);
        }
        if(x == z){
            qr[z].push_back({y,-1,c});
        }else{
            qr[z].push_back({x,y,c});
        }
    }
    calc(1);
    cout << res << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int T = 1;
//    cin >> T;
    while(T--){
        test();
    }
}