#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
int n, m, k;
vector<int>P, Order;
vector<array<int, 2>>Q;
vector<vector<int>>A;
vector<map<int, int>>Has;
void pre(){
P.clear(), Order.clear(), Q.clear(), A.clear(), Has.clear();
P.resize(n+1), Q.resize(n+1), A.resize(n+1), Has.resize(n+1);
}
void dfs(int u){
for(int i=0;i<A[u].size();i++){
int v=A[u][i];
if(v!=P[u])
dfs(v);
}
Order.push_back(u);
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
cin>>n>>m>>k;
pre();
for(int i=2;i<=n;i++){
cin>>P[i];
int u=i, v=P[i];
A[u].push_back(v);
A[v].push_back(u);
}
for(int j=0;j<m;j++){
int v, d, c;
cin>>v>>d>>c;
Q[v]={d, c};
}
dfs(1);
for(int kk=0;kk<n;kk++){
int u=Order[kk];
for(auto v:A[u]){
if(v==P[u])
continue;
map<int, int>New=Has[u];
for(auto it2:Has[v]){
int d=it2.FF, benf=it2.SS, mx=0;
for(auto it:Has[u]){
if(it.FF>d)
New[it.FF]=max(New[it.FF], it.SS+benf);
else
mx=max(mx, it.SS);
}
if(Has[u].find(d)!=Has[u].end())
New[d]=max(Has[u][d], benf+mx);
else
New[d]=benf+mx;
}
Has[u]=New;
}
if(Q[u][0]){
int d=Q[u][0], benf=Q[u][1], mx=0;
for(auto it:Has[u]){
if(it.FF>d)
break;
mx=max(mx, it.SS);
}
Has[u][d]=max(Has[u][d], benf+mx);
}
}
int ans=0;
for(auto it:Has[1])
ans=max(ans, it.SS);
cout<<ans;
}
