#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<float.h>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
#define int long long
#define double long double
const int mod=998244353,mxn=1e5,lg=22;//inf=1e18,minf=-1e18,Mxn=100000;
vector<int>adj[mxn+10];
int dp[mxn+10][22];
pii info[mxn+10];
int n,m,k;
void dfs(int cur,int p){
for(auto i:adj[cur])dfs(i,cur);
for(auto i:adj[cur])for(int j=0;j<=k;j++)dp[cur][j]+=dp[i][j];
dp[cur][info[cur].f]+=info[cur].s;
for(int j=1;j<=k;j++)dp[cur][j]=max(dp[cur][j],dp[cur][j-1]);
}
int32_t main(){
fastio
cin>>n>>m>>k;
if(k>20)return 0;//sub 1,4,5
//if work->small to large to op?
for(int i=2;i<=n;i++){
int p;cin>>p;
adj[p].pb(i);
}
for(int i=0;i<m;i++){
int v,d,w;cin>>v>>d>>w;
info[v]={d,w};
}
dfs(1,-1);
int ans=0;
for(int i=0;i<=k;i++)ans=max(ans,dp[1][i]);
cout<<ans;
return 0;
}
