#include<bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define memo(a,v) memset(a,v,sizeof(a))
#define CLR(a) memo(a,0)
#define SET(a) memo(a,-1)
#define pb push_back
#define all(a) a.begin(),a.end()
#define eps (1e-9)
#define inf (1<<30)
#define i64 long long
#define u64 unsigned i64
#define AIN(a,b,c) assert(a<=b && b<=c)
#define MOD 1000000007
#define MAX 605

vector<int> adj[100005],g[1405];
int cap[1405][1405],par[1405],N,n,cnt,P[100005][20],L[100005],D[100005],F[100005],Bx[705],By[705],LCA[705];

void dfs(int x,int p,int lv){

    int sz = adj[x].size();

    int i, y;
    L[x] = lv;
    D[x] = ++cnt;
    P[x][0] = p;
    for(i = 0;i<sz;i++){
        y = adj[x][i];
        if(y == p) continue;

        dfs(y,x,lv+1);
    }
    F[x] = ++cnt;
}
int lca(int p, int q)
{
    int lg, i;
     if (L[p] < L[q])
         swap(p,q);
     for (lg = 1; 1 << lg <= L[p]; lg++);
     lg--;

     for (i = lg; i >= 0; i--)
         if (L[p] - (1 << i) >= L[q])
             p = P[p][i];
      if (p == q)
         return p;
      for (i = lg; i >= 0; i--)
         if (P[p][i] != -1 && P[p][i] != P[q][i])
             p = P[p][i], q = P[q][i];
    return P[p][0];
}
inline bool IsChild(int u,int v){
    if(D[u]<=D[v] && F[v]<=F[u]) return true;
    return false;
}
bool intersect(int u1,int v1,int p1,int u2,int v2,int p2){
    if(IsChild(p1,p2) && IsChild(p2,u1)) return true;
    if(IsChild(p1,u2) && IsChild(u2,u1)) return true;
    if(IsChild(p1,v2) && IsChild(v2,u1)) return true;

    if(IsChild(p1,p2) && IsChild(p2,v1)) return true;
    if(IsChild(p1,u2) && IsChild(u2,v1)) return true;
    if(IsChild(p1,v2) && IsChild(v2,v1)) return true;

    if(IsChild(p2,p1) && IsChild(p1,u2)) return true;
    if(IsChild(p2,u1) && IsChild(u1,u2)) return true;
    if(IsChild(p2,v1) && IsChild(v1,u2)) return true;

    if(IsChild(p2,p1) && IsChild(p1,v2)) return true;
    if(IsChild(p2,u1) && IsChild(u1,v2)) return true;
    if(IsChild(p2,v1) && IsChild(v1,v2)) return true;
    return false;

}
void addEdge(int x,int y,int c){
    g[x].pb(y);
    g[y].pb(x);
    cap[x][y]+=c;
}
bool bfs(int s,int t){
    int i,u,v,sz;
    queue<int> q;
    q.push(s);
    for(i = 0;i<N;i++){
        par[i] = -1;
    }
    par[s] = -2;
    while(!q.empty()){
        u = q.front();
        q.pop();
        sz = g[u].size();
        for(i = 0;i<sz;i++){
            v = g[u][i];
            if(par[v] == -1 && cap[u][v]>0){
                par[v] = u;
                q.push(v);
            }
        }
    }
    return par[t]!=-1;
}
int dinic(int s,int t){
    int flow = 0,i,u,v;
    while(bfs(s,t)){
        for(i = 0;i<N;i++){
            if(par[i]<0 || cap[i][t]<=0) continue;
            int f = cap[i][t];
            for(v = i,u = par[v];v!=s;v = u,u = par[v])
                f = min(f,cap[u][v]);
            for(v = i,u = par[v];v!=s;v = u,u = par[v]){
                cap[u][v] -=f;
                cap[v][u] +=f;
            }
            cap[i][t]-=f;
            cap[t][i]+=f;
            flow += f;
        }
    }
    return flow;
}
int main(){
    int m1,m2,i,j,x,y,source,sink,c,sum = 0;
    SET(P);
    scanf("%d %d %d",&n,&m1,&m2);
    AIN(1,n,100000);
    AIN(1,m1,700);
    AIN(1,m2,700);

    for(i = 0;i<n-1;i++){
        scanf("%d %d",&x,&y);
        AIN(1,x,n);
        AIN(1,y,n);
        x--, y--;
        adj[x].pb(y);
        adj[y].pb(x);
    }
    cnt = 0;
    dfs(0,-1,1);
    assert(cnt == 2*n);
    for (j = 1; (1 << j) < n; j++)
         for (i = 0; i < n; i++)
             if (P[i][j - 1] != -1)
                 P[i][j] = P[P[i][j - 1]][j - 1];


    CLR(cap);
    source = m1+m2;
    sink = source + 1;
    N = sink + 1;
    for(i = 0;i<m1;i++){
        scanf("%d %d %d",&Bx[i],&By[i],&c);
        AIN(1,Bx[i],n);
        AIN(1,By[i],n);
        AIN(1,c,1000000);
        Bx[i]--;
        By[i]--;
        LCA[i] = lca(Bx[i],By[i]);
        sum+=c;
        addEdge(source,i,c);
    }
    for(i = 0;i<m2;i++){
        scanf("%d %d %d",&x,&y,&c);
        AIN(1,x,n);
        AIN(1,y,n);
        AIN(1,c,1000000);
        x--,y--;
        for(j = 0;j<m1;j++){
            if(intersect(x,y,lca(x,y),Bx[j],By[j],LCA[j])){
                addEdge(j,i+m1,inf);
            }
        }
        addEdge(i+m1,sink,c);
        sum+=c;
    }
    printf("%d\n",sum - dinic(source,sink));
	return 0;
}