#include <bits/stdc++.h>
#define N 100005
#define ll long long int
#define fo(i,x,y) for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define mod 1000000007
using namespace std;
ll n,m,ar[N],sum,t,k,dp[N][21],val[N];
vector<int> v[N];
ll f(int ind,int back,int l)
{
if(dp[ind][l]!=-1)
return dp[ind][l];
ll t1=0;
ll t2=0;
for(int i=0;i<v[ind].size();i++)
t1+=f(v[ind][i],ind,l);
if(ar[ind]<l && ar[ind]!=0)
for(int i=0;i<v[ind].size();i++)
t2+=f(v[ind][i],ind,ar[ind]);
if(ar[ind]<l && ar[ind]!=0)
t2+=val[ind];
if(ar[ind]==l && l!=0)
t1+=val[ind];
// cout<<ind<<sp<<l<<sp<<t1<<sp<<t2<<endl;
return dp[ind][l]=max(t1,t2);
}
int main()
{
fast;
cin>>n>>m>>k;
memset(dp,-1,sizeof(dp));
fo(i,2,n)
{
int a;
cin>>a;
v[a].pb(i);
}
fo(i,1,m)
{
ll a,b,c;
cin>>a>>b>>c;
ar[a]=b;
val[a]=c;
}
// fo(i,1,n)
// cout<<ar[i]<<sp;
// cout<<endl;
// fo(i,1,n)
// cout<<val[i]<<sp;
// cout<<endl;
cout<<f(1,1,20);
}
