#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

#define LOGN 18
const int N=101000;
const int M=501000;
int dep[N],p[N][20];
ll dp[N],pd[N];
VI e[N],ed[N],bg[N];
int pt[M][3],n,m,k;
int lca(int u,int v) {
	if (dep[u]>dep[v]) swap(u,v);
	per(i,0,LOGN) if (dep[p[v][i]]>=dep[u]) v=p[v][i];
	if (u==v) return u;
	per(i,0,LOGN) if (p[v][i]!=p[u][i]) u=p[u][i],v=p[v][i];
	return p[u][0];
}

void dfs0(int u,int f) {
	dep[u]=dep[f]+1;
	p[u][0]=f;
	for (auto v:e[u]) if (v!=f) {
		dfs0(v,u);
	}
}

struct ds {
	ll off;
	map<int,ll> val;
	ll query(int x) {
		assert(val.count(x));
		return val[x]+off;
	}
	void erase(int x) {
		assert(val.count(x));
		val.erase(x);
	}
	void add(int x,ll y) {
		val[x]=y-off;
	}
}dps[N];
void merge(ds &a,ds &b) {
	if (SZ(a.val)<SZ(b.val)) {
		a.val.swap(b.val);
		swap(a.off,b.off);
	}
	for (auto [x,val]:b.val) a.val[x]=val+b.off-a.off;
	b.val.clear();
}

int br(int u,int x) {
	per(i,0,LOGN) if (dep[p[u][i]]>dep[x]) {
		u=p[u][i];
	}
	return u;
}

void dfs(int u,int f) {
	map<int,int> sid;
	int m=0;
	ll tdp=0;
	for (auto v:e[u]) if (v!=f) {
		dfs(v,u);
		sid[v]=(1<<m);
		tdp+=dp[v];
		m++;
	}
	vector<pair<int,ll>> mg;
	for (auto i:ed[u]) {
		int x=pt[i][0],y=pt[i][1],w=pt[i][2];
		int px=br(x,u),py=br(y,u);
		//printf("?? %d %d %d %d\n",x,px,y,py);
		if (px!=u) {
			ll wt=dps[px].query(i)+dps[py].query(i)+w-(dp[px]+dp[py]);
			int st=sid[px]|sid[py];
			mg.pb(mp(st,wt));
			dps[px].erase(i);
			dps[py].erase(i);
		} else {
			ll wt=dps[py].query(i)+w-dp[py];
			int st=sid[py];
			mg.pb(mp(st,wt));
			dps[py].erase(i);
		}
	}
	rep(i,0,(1<<m)) pd[i]=0;
	for (auto [st,wt]:mg) rep(i,0,(1<<m)) if ((i&st)==0) 
		pd[i|st]=max(pd[i|st],pd[i]+wt);
	int ts=(1<<m)-1;
	dp[u]=tdp+pd[ts];
	for (auto v:e[u]) if (v!=f) {
		dps[v].off+=tdp-dp[v]+pd[ts-sid[v]];
		merge(dps[u],dps[v]);
	}
	for (auto i:bg[u]) {
		dps[u].add(i,dp[u]);
	}
	/*printf("u: %d dp: %lld\n",u,dp[u]);
	for (auto [x,val]:dps[u].val) printf("dps %d: %lld\n",x,val+dps[u].off);*/
}

int main() {
	scanf("%d%d%d",&n,&m,&k);
	rep(i,1,n) {
		int x,y;
		scanf("%d%d",&x,&y);
		e[x].pb(y);
		e[y].pb(x);
	}
	dfs0(1,0);
	rep(j,1,LOGN) rep(i,1,n+1) p[i][j]=p[p[i][j-1]][j-1];
	rep(i,0,m) {
		scanf("%d%d%d",&pt[i][0],&pt[i][1],&pt[i][2]);
		int &u=pt[i][0],&v=pt[i][1];
		int w=lca(u,v);
		if (v==w) swap(u,v);
		if (u!=w) bg[u].pb(i);
		if (v!=w) bg[v].pb(i);
		ed[w].pb(i);
	}
	dfs(1,0);
	printf("%lld\n",dp[1]);
}