#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

const int mxn = 3e5+5;

int n,m,f[mxn],a[mxn],dep[mxn];
vector<int> adj[mxn];
vector<array<int,2>> cam[mxn];
map<int,int> dp[mxn]; //y = how many exist at depth[x] in subtree

void merge(map<int,int> &a, map<int,int> &b, map<int,int> &c) {
	if (sz(a) < sz(b)) swap(a,b);
	for (auto [x,y] : b) {
		if (!a.count(x)) a[x] = 0;
		a[x] += y;
	}
	c = a;
}

int cnt = 0;

void dfs(int v) {
	dp[v][-dep[v]] = a[v];
	for (int u : adj[v]) {
		dfs(u);
		merge(dp[u],dp[v],dp[v]);
	}

	while (sz(dp[v]) && sz(cam[v])) {
		auto [x,y] = *dp[v].begin();
		int dx = -x;
		dp[v].erase(dp[v].begin());
		while (sz(cam[v])) {
			auto &[a,b] = cam[v].back();
			if (!b) {
				cam[v].pop_back();
				continue;
			}
			if (dx > dep[v]+a) {
				cam[v].pop_back();
				continue;
			}
			if (b > y) {
				b -= y;
				cnt += y;
				break;
			} else {
				y -= b;
				cnt += b;
				b = 0;
				dp[v].insert({x,y});
			}
		}
		if (!sz(cam[v])) break;
	}
}

void solve() {
	cin>>n>>m; dep[0] = 0;
	for (int i=0; i<n; i++) adj[i].clear();
	for (int i=0; i<n; i++) cam[i].clear();
	for (int i=0; i<n; i++) dp[i].clear();
	for (int i=1; i<n; i++) {
		cin>>f[i]; --f[i];
		adj[f[i]].push_back(i);
		dep[i] = dep[f[i]]+1;
	}
	for (int i=0; i<n; i++) cin>>a[i];
	for (int i=0; i<m; i++) {
		int x,k,c; cin>>x>>k>>c; --x;
		cam[x].push_back({k,c});
	}
	for (int i=0; i<n; i++) {
		sort(all(cam[i]));
	}
	dfs(0);
	int su = 0;
	for (int i=0; i<n; i++) {
		su += a[i];
	}
	cout<<su-cnt;
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int t; cin>>t;
	while (t--) solve();

	return 0;
}