#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <map>
// #include <bit>
// #pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define forn(i, n) for (int i = 0; i<n; i++)
#define forl(i, a, b) for (int i = a; i<b; i++)
#define spc << ' '
#define el << '\n'
#define nl cout << '\n'
#define pb push_back
#define sz size
#define fi first
#define se second
#define rsz resize
const int inf = 1e9;
const ll inf2 = 1e18;

const int MAXN = 100005;
vector<int> ch[MAXN];
int v[MAXN], d[MAXN];
multiset<pii> wt[MAXN];

void dfs(int cn) {
    for (int i : ch[cn]) {
        dfs(i);
        if (sz(wt[i]) > sz(wt[cn])) swap(wt[i], wt[cn]);
        for (pii j : wt[i]) wt[cn].insert(j);
    }
    if (v[cn]) {
        wt[cn].insert({d[cn], v[cn]});
        int cv = v[cn];
        auto ptr = wt[cn].lower_bound({d[cn]+1, -1});
        while ((ptr = wt[cn].lower_bound({d[cn]+1, -1})) != wt[cn].end()) {
            if ((*ptr).se > cv) {
                auto temp = *ptr;
                temp.se -= cv;
                wt[cn].erase(ptr);
                wt[cn].insert(temp);
                break;
            }
            cv -= (*ptr).se;
            wt[cn].erase(ptr);
        }
    }
}

int main() {
    cin.tie(NULL); ios_base::sync_with_stdio(false);
    int n, m, k; cin >> n >> m >> k;
    forn(i,n-1) {
        int p; cin >> p;
        ch[p-1].pb(i+1);
    }
    forn(i,m) {
        int ve, dt, w; cin >> ve >> dt >> w;
        ve--;
        v[ve] = w;
        d[ve] = dt;
    }
    dfs(0);
    ll tot = 0;
    for (auto i : wt[0]) tot += i.se;
    cout << tot << endl;
}