/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < ll, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
const ll mod = (ll) 998244353;
//const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 1e5 + 5;
ll par[N][18];
ll sub[N], dp[N];
vector < ll > v[N];
vector < ll > g[N];
ll sub_sum[N][18], dp_sum[N][18];
ll mx[N], d[N];
vector < tuple < ll , ll , ll > > Q[N];
ll lift(ll s, ll k){
for(ll i = 17; i >= 0; i--){
if(k & (1 << i)) s = par[s][i];
}
return s;
}
ll get(ll s, ll k, bool ok = 0){
ll ans = 0;
for(ll i = 17; i >= 0; i--){
if(k & (1 << i)){
ans += sub_sum[s][i] - dp_sum[s][i];
s = par[s][i];
}
}
// cout << ans << '\n';
return ans;
}
ll lca(ll x, ll y){
if(d[x] < d[y]) swap(x, y);
for(ll i = 17; i >= 0; i--){
if(d[x] - (1 << i) >= d[y]) x = par[x][i];
}
if(x == y) return x;
for(ll i = 17; i >= 0; i--){
if(par[x][i] != par[y][i]) x = par[x][i], y = par[y][i];
}
return par[x][0];
}
void dfs(ll s, ll p, ll dth){
d[s] = dth;
par[s][0] = p;
for(ll i = 1; i <= 17; i++) par[s][i] = par[par[s][i - 1]][i - 1];
for(auto u : v[s]){
if(u - p){
dfs(u, s , dth + 1);
}
}
return;
}
void final(ll s, ll p){
dp[s] = 0, sub[s] = 0;
for(auto u : v[s]){
if(u - p){
final(u, s);
sub[s] += dp[u];
}
}
dp[s] = sub[s];
for(auto [x, y, c] : Q[s]){
ll res = sub[s] + c;
if(x > y) swap(x, y);
if(x != s) res += get(x, d[x] - d[s]);
if(y != s) res += get(y, d[y] - d[s]);
//cout << x << ' ' << y<< ' ' << c << ' ' << res << '\n';
dp[s] = max(dp[s], res);
}
dp_sum[s][0] = dp[s];
sub_sum[s][0] = sub[s];
mx[s] = 0;
g[lift(s, 1)].pb(s);
sort(g[s].begin(), g[s].end(), [](ll i, ll j){
return mx[i] < mx[j];
});
for(auto u : g[s]){
mx[u]++;
dp_sum[u][mx[u]] = dp_sum[u][mx[u] - 1] + dp_sum[par[u][mx[u] - 1]][mx[u] - 1];
sub_sum[u][mx[u]] = sub_sum[u][mx[u] - 1] + sub_sum[par[u][mx[u] - 1]][mx[u] - 1];
g[lift(u, ( (1 << (mx[u] + 1)) - 1))].pb(u);
}
//cout << "! " << s << ' ' << dp[s] << '\n';
return;
}
void solve(){
ll n;
cin >> n;
for(ll i = 1; i < n; i++){
ll x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
mem(par, 0);
mem(dp_sum, 0);
mem(sub_sum, 0);
ll q; cin >> q;
dfs(1, 0, 1);
for(ll i = 1; i <= q; i++){
ll x,y,c; cin >> x >> y >> c;
Q[lca(x,y)].pb({x, y, c});
}
final(1, 0);
cout << dp[1] << '\n';
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre(N);
ll T = 1, CT = 0; //cin >> T;
while(T--){
// cout << "Case #" << ++CT <<": " ;
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}
