#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;
const int MAXP = MAXN * 20;

namespace SegT {
int ls[MAXP], rs[MAXP], pcnt = 0;
ll mx[MAXP], tag[MAXP];
#define lson(u) ls[u],l,mid
#define rson(u) rs[u],mid+1,r
inline void push_up(int u) {
    mx[u] = max(mx[ls[u]], mx[rs[u]]);
}
inline void upd(int u, ll k) {
    if (!u)
        return;

    tag[u] += k;
    mx[u] += k;
}
inline void push_down(int u) {
    if (tag[u]) {
        upd(ls[u], tag[u]);
        upd(rs[u], tag[u]);
        tag[u] = 0;
    }
}
void insert(int &u, int l, int r, int q, ll k) {
    if (!u)
        u = ++pcnt;

    if (l == r) {
        mx[u] += k;
        return;
    }

    push_down(u);
    int mid = (l + r) >> 1;

    if (q <= mid)
        insert(lson(u), q, k);
    else
        insert(rson(u), q, k);

    push_up(u);
}
void merge(int &u, int l, int r, int v, ll preu, ll prev) {
    if (!u && !v)
        return;

    if (!u) {
        upd(u = v, preu);
        return;
    }

    if (!v) {
        upd(u, prev);
        return;
    }

    if (l == r) {
        mx[u] = max(mx[u], preu) + max(mx[v], prev);
        return;
    }

    push_down(u);
    push_down(v);
    int mid = (l + r) >> 1;
    merge(rson(u), rs[v], max(preu, mx[ls[u]]), max(prev, mx[ls[v]]));
    merge(lson(u), ls[v], preu, prev);
    push_up(u);
}

int n;
inline void insert(int &u, int q, ll k) {
    insert(u, 1, n, q, k);
}
inline void merge(int &u, int v) {
    merge(u, 1, n, v, 0, 0);
}
}

vector<int> g[MAXN];
int a[MAXN], b[MAXN];

int rt[MAXN];
void dfs_res(int u) {
    for (int v : g[u]) {
        dfs_res(v);
        SegT::merge(rt[u], rt[v]);
    }

    if (b[u])
        SegT::insert(rt[u], a[u], b[u]);
}

int main(void) {
    int n, m, d;
    scanf("%d%d%d", &n, &m, &d);

    for (int i = 2; i <= n; ++i) {
        int j;
        scanf("%d", &j);
        g[j].push_back(i);
    }

    for (int i = 1; i <= m; ++i) {
        int u, x, y;
        scanf("%d%d%d", &u, &x, &y);
        a[u] = x;
        b[u] = y;
    }

    SegT::n = d;
    dfs_res(1);

    printf("%lld", SegT::mx[rt[1]]);
    return 0;
}