# include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
#define pii pair <int, int>
#define pb push_back
using namespace std;
const int N = 1e5+5;
int t,n,a[N],m,k,tim[N],val[N],va,ti;
int ans,mx,p,vert,mp[N],cnt,dp[N][1005];
vector <int> v[N],vv;
void dfs(int a, int p) {
for (int i = 0; i < v[a].size(); i++) {
int to = v[a][i];
if (to == p) continue;
dfs(to,a);
}
for (int i = 1; i <= mx; i++) {
int sum = 0;
int sum1 = 0;
for (int j = 0; j < v[a].size(); j++) {
int to = v[a][j]; if (to == p) continue;
sum += dp[to][i];
sum1 += dp[to][tim[a]];
}
if (tim[a] <= i)
dp[a][i] = max(sum, sum1 + val[a]);
else dp[a][i] = sum;
ans = max(ans, dp[a][i]);
}
}
main() {
std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n>>m>>k;
for (int i = 2; i <= n; i++){
cin>>p;
v[p].pb(i);
v[i].pb(p);
}
dfs(1,0);
for (int i = 1; i <= m; i++){
cin>>vert>>ti>>va;
vv.pb(ti);
tim[vert] = ti;
val[vert] = va;
}
sort(vv.begin(),vv.end());
for (int i = 0; i < vv.size(); i++) {
if (i == 0)cnt++; else if (vv[i] != vv[i - 1]) cnt++;
mp[vv[i]] = cnt;
}
for (int i = 1; i <= n; i++) {
tim[i] = mp[tim[i]];
mx = max(mx,tim[i]);
}
dfs(1,0);
cout<<ans<<"\n";
}
