#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=100005,K=20;
int n,m,K0,dep[N];
int id[N];
int fa[N][K];
vector<int>e[N];
int jump(int u,int k){
	per(i,K-1,0)if(k>>i&1)u=fa[u][i];
	return u;
}
int LCA(int u,int v){
	if(dep[u]<dep[v])swap(u,v);
	u=jump(u,dep[u]-dep[v]);
	if(u==v)return u;
	per(i,K-1,0)if(fa[u][i]!=fa[v][i])u=fa[u][i],v=fa[v][i];
	return fa[u][0];
}
void dfs1(int k1,int k2){
	dep[k1]=dep[k2]+1;
	fa[k1][0]=k2;
	rep(i,1,K-1)fa[k1][i]=fa[fa[k1][i-1]][i-1];
	if(k2)e[k1].erase(find(e[k1].begin(),e[k1].end(),k2));
	rep(i,0,SZ(e[k1])-1){
		id[e[k1][i]]=i;
		dfs1(e[k1][i],k1);
	}
}
struct dsu{
	int fa[N];
	LL w[N];
	dsu(){rep(i,0,N-1)fa[i]=i;}
	int fd(int u){
		if(u==fa[u])return u;
		int old=fa[u];
		fa[u]=fd(fa[u]);
		w[u]+=w[old];
		return fa[u];
	}
}o;
LL f[N];
vector<tuple<int,int,int> >vec[N];
void dfs2(int k1){
	vector<LL>dp(1<<SZ(e[k1]));
	for(auto&x:e[k1]){
		dfs2(x);
		for(int s=1<<id[x];s<(1<<SZ(e[k1]));++s|=1<<id[x]){
			dp[s]=max(dp[s],dp[s^(1<<id[x])]+f[x]);
		}
	}
	for(auto&[a,b,w]:vec[k1]){
		if(a==k1){
			o.fd(b);
			for(int s=1<<id[o.fa[b]];s<(1<<SZ(e[k1]));++s|=1<<id[o.fa[b]]){
				dp[s]=max(dp[s],dp[s^(1<<id[o.fa[b]])]+f[b]+o.w[b]+w);
			}
		}else{
			o.fd(a),o.fd(b);
			int mask=(1<<id[o.fa[a]])|(1<<id[o.fa[b]]);
			for(int s=mask;s<(1<<SZ(e[k1]));++s|=mask){
				dp[s]=max(dp[s],dp[s^mask]+f[a]+o.w[a]+f[b]+o.w[b]+w);
			}
		}
	}
	f[k1]=dp[(1<<SZ(e[k1]))-1];
	for(auto&x:e[k1]){
		o.fa[x]=k1;
		o.w[x]=dp[(1<<SZ(e[k1]))-1-(1<<id[x])];
	}
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(n),rd(m),rd(K0);
	rep(i,2,n){
		int u,v;
		rd(u),rd(v);
		e[u].pb(v),e[v].pb(u);
	}
	dfs1(1,0);
	rep(i,1,m){
		int u,v,w;
		rd(u),rd(v),rd(w);
		if(dep[v]<dep[u])swap(u,v);
		vec[LCA(u,v)].eb(u,v,w);
	}
	dfs2(1);
	printf("%lld\n",f[1]);
	return 0;
}