#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 500005;
map <int, int> f[N];
vector <int> e[N];
vector <pair <int, int> > h[N];
int n, m, T, a[N], dep[N];
void dfs(int x){
	for(int i: e[x]){
		dfs(i);
		if(f[i].size() > f[x].size()) swap(f[i], f[x]);
		for(auto j: f[i]) f[x][j.first] += j.second;
	} f[x][dep[x]] += a[x];
	for(auto i: h[x]) while(i.second){
		auto t = f[x].upper_bound(dep[x] + i.first);
		if(t == f[x].begin()) break; t--;
		int h = min(t->second, i.second);
		i.second -= h, t->second -= h;
		if(!t->second) f[x].erase(t);
	}
}
signed main(){
	cin >> T;
	while(T--){
		cin >> n >> m;
		for(int i = 1; i <= n; i++) e[i].clear(), f[i].clear(), h[i].clear();
		for(int i = 2, x; i <= n; i++) cin >> x, dep[i] = dep[x] + 1, e[x].push_back(i);
		for(int i = 1; i <= n; i++) cin >> a[i];
		for(int i = 1, x, k, c; i <= m; i++) cin >> x >> k >> c, h[x].push_back({k, c});
		dfs(1); int ans = 0;
		for(auto i: f[1]) ans += i.second;
		cout << ans << '\n';
	}
	return 0;
}