#include <bits/stdc++.h>
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i,n) for ((i)=(n);(i)>=1;(i)--)
#define fz0g(i,n) for ((i)=0;(i)<=(n);(i)++)
#define fd0g(i,n) for ((i)=(n);(i)>=0;(i)--)
#define fz0k(i,n) for ((i)=0;(i)<(n);(i)++)
#define fd0k(i,n) for ((i)=(((long long)(n))-1);(i)>=0;(i)--)
#define fz(i,x,y) for ((i)=(x);(i)<=(y);(i)++)
#define fd(i,y,x) for ((i)=(y);(i)>=(x);(i)--)
#define ff(c,itr) for (__typeof((c).begin()) itr=(c).begin();itr!=(c).end();++itr)
#define spln(i,n) (i==n?'\n':' ')
using namespace std;
typedef long long i64;
inline void read(int &x)
{
	char c;int f=1;
	while(!isdigit(c=getchar()))if(c=='-')f=-1;
	x=(c&15);while(isdigit(c=getchar()))x=(x<<1)+(x<<3)+(c&15);
	x*=f;
}
inline void read(i64 &x)
{
	char c;int f=1;
	while(!isdigit(c=getchar()))if(c=='-')f=-1;
	x=(c&15);while(isdigit(c=getchar()))x=(x<<1)+(x<<3)+(c&15);
	x*=f;
}
int typ,_;
int n,m,i,j;
vector<int> bi[100005],v[100005];
int fa[100005],id[100005],sz[100005],tp[100005],son[100005],dfn[100005],ti,mp[100005],dep[100005];
int px[500005],py[500005],plca[500005],plx[500005],ply[500005];i64 pv[500005];

void dfs1(int x,int p)
{
	sz[x]=1;fa[x]=p;int c=0;
	if(p) bi[x].erase(find(bi[x].begin(),bi[x].end(),p));
	ff(bi[x],it){id[*it]=c++;dep[*it]=dep[x]+1;dfs1(*it,x);sz[x]+=sz[*it];if(!son[x]||sz[son[x]]<sz[*it])son[x]=*it;}
}
void dfs2(int x,int t)
{
	mp[dfn[x]=++ti]=x;tp[x]=t;
	if(son[x])dfs2(son[x],t);
	ff(bi[x],it)if(*it!=son[x])dfs2(*it,*it);
}
int lca(int x,int y)
{
	while(tp[x]!=tp[y]){if(dep[tp[x]]<dep[tp[y]])swap(x,y);x=fa[tp[x]];}
	return mp[min(dfn[x],dfn[y])];
}
int gtp(int x,int d)
{
	if(dep[x]<d) return x;
	while(dep[tp[x]]>d) x=fa[tp[x]];
	return mp[dfn[x]-(dep[x]-d)];
}

struct bit
{
	i64 s[500005];
	void add(int x,i64 c){while(x<=n) s[x]+=c,x+=(x&-x);}
	i64 query(int x){i64 c=0;while(x) c+=s[x],x&=(x-1);return c;}
}t1;
i64 query1(int x)
{
	i64 s=0;
	while(x){
		s+=t1.query(dfn[x])-t1.query(dfn[tp[x]]-1);
		x=fa[tp[x]];
	}
	return s;
}

vector<i64> f[100005];
i64 g[20][20],g0[20];
i64 h[100005];
void dfs3(int x)
{
//	cerr<<x<<": ";ff(bi[x],it)cerr<<*it<<' ';cerr<<endl;
	int i,j,k,len=bi[x].size();ff(bi[x],it) dfs3(*it);
	memset(g,0,sizeof(g));memset(g0,0,sizeof(g0));
	ff(bi[x],it){
		assert(id[*it]<=_);
		g0[id[*it]]=max(g0[id[*it]],f[*it].back());
	}
	ff(v[x],it){
		pv[*it]+=query1(px[*it])+(px[*it]==x?0:f[px[*it]].back());
		pv[*it]+=query1(py[*it])+(py[*it]==x?0:f[py[*it]].back());
		if(px[*it]==x){
			g0[id[ply[*it]]]=max(g0[id[ply[*it]]],pv[*it]);
		}
		else if(py[*it]==x){
			g0[id[plx[*it]]]=max(g0[id[plx[*it]]],pv[*it]);
		}
		else{
			g[id[plx[*it]]][id[ply[*it]]]=g[id[ply[*it]]][id[plx[*it]]]=max(g[id[plx[*it]]][id[ply[*it]]],pv[*it]);
		}
	}
	f[x].resize(1<<len);
	fz1(i,(1<<len)-1){
		j=len-1;while(!((i>>j)&1))j--;
		f[x][i]=max(f[x][i],f[x][i^(1<<j)]+g0[j]);
		fz0k(k,j)if((i>>k)&1) f[x][i]=max(f[x][i],f[x][i^(1<<j)^(1<<k)]+g[j][k]);
	}
	fz0k(i,len){
		h[bi[x][i]]=f[x][(1<<len)-1-(1<<i)];
		t1.add(dfn[bi[x][i]],h[bi[x][i]]);
	}
}
int main()
{
	read(n);read(m);read(_);fz1(i,n-1){int x,y;read(x);read(y);bi[x].push_back(y);bi[y].push_back(x);}
	int rt;fz1(i,n){assert(bi[i].size()<=_);if(bi[i].size()==1)rt=i;}
	dfs1(rt,0);dfs2(rt,rt);
	fz1(i,m) read(px[i]),read(py[i]),read(pv[i]),assert(px[i]!=py[i]),v[plca[i]=lca(px[i],py[i])].push_back(i),plx[i]=gtp(px[i],dep[plca[i]]+1),ply[i]=gtp(py[i],dep[plca[i]]+1);
	dfs3(rt);
	printf("%lld\n",f[rt].back());
	return 0;
}