//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
ll MAX(ll a){return a;}
ll MIN(ll a){return a;}
template<typename... Args>
ll MAX(ll a,Args... args){return max(a,MAX(args...));}
template<typename... Args>
ll MIN(ll a,Args... args){return min(a,MIN(args...));}
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,m,k;
vector<int> al[100005];
ii fruit[100005];
ll w[100005][22]; //is this cache friendly :thinking:
void dfs(int i){
for (auto &it:al[i]){
dfs(it);
rep(x,0,22) w[i][x]+=w[it][x];
}
w[i][fruit[i].fi]+=fruit[i].se;
rep(x,0,21) w[i][x+1]=max(w[i][x+1],w[i][x]);
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m>>k;
rep(x,2,n+1){
int p;
cin>>p;
al[p].push_back(x);
}
rep(x,0,m){
int a,b,c;
cin>>a>>b>>c;
fruit[a]={b,c};
}
dfs(1);
cout<<w[1][21]<<endl;
}
