#include<bits/stdc++.h>

// #define ONLINE_JUDGE
#define INPUT_DATA_TYPE int
#define OUTPUT_DATA_TYPE long long
inline __attribute((always_inline)) INPUT_DATA_TYPE read(){register INPUT_DATA_TYPE x=0;register char f=0,c=getchar();while(c<'0'||'9'<c)f=(c=='-'),c=getchar();while('0'<=c&&c<='9')x=(x<<3)+(x<<1)+(c&15),c=getchar();return f?-x:x;}void print(OUTPUT_DATA_TYPE x){if(x<0)x=-x,putchar('-');if(x>9)print(x/10);putchar(x%10^48);return;}


struct NODE{
    int d,v;
};

std::vector<NODE> vec[300010];
std::vector<int> e[300010];
std::map<int,long long> mp[300010];

int h[300010],hson[300010],dep[300010],a[300010];

void dfsinit(int u){
    hson[u]=0;
    for(auto v:e[u]){
        dep[v]=dep[u]+1,dfsinit(v);
        if(h[v]>h[hson[u]]) hson[u]=v;
    }
    h[u]=h[hson[u]]+1;
}

void dfs(int u){
    if(hson[u]) dfs(hson[u]),mp[u]=std::move(mp[hson[u]]);
    for(auto v:e[u]) if(v!=hson[u]){
        dfs(v);
        for(auto [d,v]:mp[v]) mp[u][d]+=v;
    }
    register int sub;
    mp[u][dep[u]]+=a[u];
    for(auto [d,v]:vec[u]){
        auto it=mp[u].upper_bound(d+dep[u]);
        while(it!=mp[u].begin()){
            --it;
            sub=std::min(it->second,(long long)v);
            if(sub==it->second) it=mp[u].erase(it);
            else it->second-=sub;
            if(sub==v) break;
            else v-=sub;
        }
    }
}

void solve(){
    register int i,k,c;
    register long long res=0;
    int n=read();
    int m=read();
    for(i=1;i<=n;++i) e[i].clear();
    for(i=2;i<=n;++i) e[read()].push_back(i);
    for(i=1;i<=n;++i) a[i]=read(),vec[i].clear(),mp[i].clear();
    while(m--){
        i=read();
        k=read();
        c=read();
        vec[i].push_back({k,c});
    }
    dfsinit(1),dfs(1);
    for(auto [d,v]:mp[1]) res+=v;
    print(res),putchar('\n');
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("name.in", "r", stdin);
	freopen("name.out", "w", stdout);
	#endif

    int T=read();
    while(T--) solve();

	#ifndef ONLINE_JUDGE
	fclose(stdin);
	fclose(stdout);
	#endif
    return 0;
}