#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;
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];
void calc(int v,int pr = -1) {
    ll s = 0;
    for (int to: g[v]) {
        if (to == pr)continue;
        calc(to, v);
        dp[v][0] += max(dp[to][0], dp[to][1]);
    }
    s = dp[v][0];
    for (auto [x, y, c]: qr[v]) {
        ll S = dp[v][0];
        auto proc = [&](int u) {
            if (u == -1) return;
            while (u != v) {
                S -= max(dp[u][0], dp[u][1]);
                S += dp[u][0];
                u = up[u][0];
            }
        };
        proc(x);
        proc(y);
        dp[v][1] = max(dp[v][1], S + c);
    }
    res = max({res,dp[v][1],dp[v][0]});
}
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);
    }
    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();
    }
}