#include<bits/stdc++.h>
using u64 = unsigned long long;
using std::cin;
using std::cout;
const int mod = 998244353;
using ll = long long;

const int N = 100005;

int n, m, k;
struct edge { int to, nxt; } e[N << 1];
int h[N], num;
void link(int x, int y) {
	e[++num] = {y, h[x]}, h[x] = num;
	e[++num] = {x, h[y]}, h[y] = num;
}

int st[20][N], dfn[N], cnt;
int min(int x, int y) {
	return dfn[x] < dfn[y] ? x : y;
}

void dfs0(int x, int fa = 0) {
	st[0][cnt] = fa, dfn[x] = ++cnt;
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa) {
		dfs0(e[i].to, x);
	}
}
int lca(int x, int y) {
	if(dfn[x] > dfn[y]) std::swap(x, y);
	const int lg = std::__lg(dfn[y] - dfn[x]);
	if(x == y) return x;
	return min(st[lg][dfn[x]], st[lg][dfn[y] - (1 << lg)]);
}
struct qy { int a, b; ll w; };
std::vector<qy> v[N];

ll dp[N];
ll sdp[N];

int anc[N]; ll w[N];
int find(int x) {
	if(x == anc[x]) return x;
	int t = find(anc[x]);
	w[x] += w[anc[x]];
	anc[x] = t;
	return x;
}

ll ask(int x) {
	find(x);
	return w[x] + dp[x];
}
int id[N];
void up(ll & x, ll y) {
	if(x < y) x = y;
}
void dfs1(int x, int fa = 0) {
	int cc = 0;
	std::vector<ll> all;
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa) {
		dfs1(e[i].to, x);
		id[e[i].to] = cc++;
		sdp[x] += dp[e[i].to];
		all.push_back(dp[e[i].to]);
	}
	std::vector<qy> pb;
	for(auto [a, b, w] : v[x]) {
		if(b == x) std::swap(a, b);
		if(a == x) {
			ll res = ask(b);
			up(all[id[find(b)]], res + w);
		} else {
			ll res = ask(a) + ask(b);
			pb.push_back({ id[find(a)], id[find(b)], res + w });
		}
	}
	{
		std::vector<ll> dp(1 << cc);
		for(int i = 1;i < 1 << cc;++i) {
			dp[i] = dp[i & (i - 1)] + all[__builtin_ctz(i)];
		}
		for(auto [a, b, w] : pb) {
			int s = (1 << cc) - 1, t = (1 << a) | (1 << b);
			s ^= t;
			for(int i = s;i;i = (i - 1) & s) {
				up(dp[i | t], dp[i] + w);
			}
			up(dp[t], w);
		}
		::dp[x] = dp[(1 << cc) - 1];
	}
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa) {
		anc[e[i].to] = x;
		w[e[i].to] = sdp[x] - dp[e[i].to];
	}

}
int deg[N];
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	cin >> n >> m >> k;
	for(int i = 1, x, y;i < n;++i) {
		cin >> x >> y;
		link(x, y);
		++ deg[x]; ++ deg[y];
	}
	int r = std::min_element(deg + 1, deg + n + 1) - deg;
	dfs0(r);
	for(int i = 1;i < 20;++i)
		for(int j = 1;j + (1 << i) - 1 < n;++j)
			st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
	for(int i = 1, a, b, w;i <= m;++i) {
		cin >> a >> b >> w;
		v[lca(a, b)].push_back({a, b, w});
	}
	for(int i = 1;i <= n;++i) anc[i] = i;
	dfs1(r);
	cout << dp[r] << '\n';
}