#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
using namespace std;
template<typename T>
inline bool cmax(T&x,const T& y){return x<y?x=y,1:0;}
template<typename T>
inline bool cmin(T&x,const T& y){return y<x?x=y,1:0;}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vii; 
typedef unsigned long long ull;
#define sz(x) (int(x.size()))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define em emplace
#define X first
#define Y second
const int mod=998244353;
inline void MOD(int&x){x-=mod,x+=x>>31&mod;}
inline void MOD(ll& x){x-=mod,x+=x>>63&mod;}
inline int add(int x,int y){MOD(x+=y);return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
template<typename ... A>inline int mul(const int& x,const A&... p){return 1ll*x*mul(p...)%mod;}
inline ll ksm(ll a,ll p=mod-2){ll ans=1;for(;p;p>>=1,a=a*a%mod)if(p&1)ans=ans*a%mod;return ans;}
typedef long double LD;
constexpr int MAXN=1e5+10;
struct BIT
{
    ll t[MAXN];
    inline void add(int x,ll k){for(;x<MAXN;x+=x&-x)t[x]+=k;}
    inline ll ask(int x){ll ans=0;for(;x;x-=x&-x)ans+=t[x];return ans;}
    inline ll ask(int l,int r){if(l>r)return 0;return ask(r)-ask(l-1);}
}t;
int dfn[MAXN],top[MAXN],d[MAXN],fa[MAXN],siz[MAXN],son[MAXN];
vi e[MAXN];
int id[MAXN];
void dfs(int u)
{
    siz[u]=1;
    int cnt=0;
    for(auto&v:e[u])if(v!=fa[u])
    {
        id[v]=cnt++;
        fa[v]=u,d[v]=d[u]+1,dfs(v),siz[u]+=siz[v];
        if(siz[son[u]]<siz[v])son[u]=v;
    }
}
void pf(int u,int tp)
{
    static int tt;
    dfn[u]=++tt,top[u]=tp;
    if(!son[u])return;
    pf(son[u],tp);
    for(auto&v:e[u])if(v!=fa[u]&&v!=son[u])pf(v,v);
}
inline int LCA(int u,int v)
{
    while(top[u]!=top[v])d[top[u]]>d[top[v]]?u=fa[top[u]]:v=fa[top[v]];
    return d[u]<d[v]?u:v;
}
inline int jump(int u,int v)
{
    int la=-1;
    while(top[v]!=top[u])la=top[v],v=fa[la];
    if(v==u)return la;
    else return son[u];
}
ll tot[MAXN];
ll F[MAXN][13];

inline ll getsum(int u,int v)
{
    //return 0;
    ll ans=tot[v]-F[v][id[son[v]]];
   // cerr<<ans<<'\n';
    while(top[u]!=top[v])
    {
        ans+=F[fa[top[v]]][id[top[v]]]-F[fa[top[v]]][id[son[fa[top[v]]]]];

        ans+=t.ask(dfn[top[v]],dfn[v]);
        v=fa[top[v]];
    }
    ans+=t.ask(dfn[u],dfn[v]);
  //  cerr<<ans<<'\n';
    return ans;
}
vector<tuple<int,int,int> >ve[MAXN];
void dp(int u)
{
    if(u!=1)e[u].erase(find(all(e[u]),fa[u]));
    for(auto&v:e[u])dp(v);
    int m=sz(e[u]);
    vector<ll> F(1<<m);
    for(auto&v:e[u])
    {
        
        int S=(1<<m)-1;S^=1<<id[v];
        for(int s=S;s;s=S&(s-1))cmax(F[s|(1<<id[v])],F[s]+tot[v]);
        cmax(F[1<<id[v]],tot[v]);
    }
  //  cerr<<"!\n";
    for(auto&[x,y,w]:ve[u])
    {
        
        int st=0;
        ll res=w;
        if(x!=u)
        {
            int xx=jump(u,x);
            res+=getsum(xx,x);
            st|=1<<id[xx];
        }
        if(y!=u)
        {
            int yy=jump(u,y);
            res+=getsum(yy,y);
            st|=1<<id[yy];
        }
       // if(u==1)cerr<<res<<'\n';
        int S=(1<<m)-1;S^=st;
        for(int s=S;s;s=S&(s-1))cmax(F[s|st],F[s]+res);
        cmax(F[st],res);
    }
    for(int i=0;i<m;i++)::F[u][i]=F[((1<<m)-1)^(1<<i)];
    tot[u]=F[(1<<m)-1];
   // cerr<<::F[u][id[son[u]]]<<'\n';
    t.add(dfn[u],::F[u][id[son[u]]]);
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(10);
    int n,m,k;cin>>n>>m>>k;
    for(int i=1,u,v;i<n;i++)cin>>u>>v,e[u].emplace_back(v),e[v].emplace_back(u);
    dfs(1),pf(1,1);
    for(int i=1,x,y,w;i<=m;i++)
    {
        cin>>x>>y>>w;
        ve[LCA(x,y)].emplace_back(x,y,w);
    }
    dp(1);
    cout<<tot[1];
	return 0;
}