#include <bits/stdc++.h>
#define int long long
using namespace std;
#define file ""
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return l + rd() % (r - l + 1);
}
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
template<class X, class Y> bool mini(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
int n, m, k;
vector<int> adj[N];
map<int, int> f[N];
int val[N], moment[N];
void dfs(int u) {
for (int v : adj[u]) {
dfs(v);
if ((int) f[v].size() > (int) f[u].size()) swap(f[u], f[v]);
for (auto i : f[v]) f[u][i.fi] += i.se;
}
f[u][moment[u]] += val[u];
auto it = f[u].upper_bound(moment[u]);
int rem = val[u];
while (rem && it != f[u].end()) {
if (rem >= it->se) {
rem -= it->se;
it = f[u].erase(it);
} else {
it->se -= rem;
rem = 0;
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> n >> m >> k;
for (int i = 2; i <= n; ++i) {
int p;
cin >> p;
adj[p].push_back(i);
}
for (int i = 1; i <= m; ++i) {
int u, d, c;
cin >> u >> d >> c;
val[u] = c;
moment[u] = d;
}
dfs(1);
int res = 0;
for (auto i : f[1]) res += i.se;
cout << res;
return 0;
}
/*
*/
