#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define all(x) (x).begin(), (x).end()
#define ls id << 1
#define rs id << 1 | 1

void solve(){
	int n;
	cin >> n;
	vector<int>a(n+5);
	vector<vector<int>>g(n+5);
	for(int i = 2, p;i <= n;i++){
		cin >> p;
		g[p].push_back(i);
		g[i].push_back(p);
	}
	for(int i = 1;i <= n;i++){
		cin >> a[i];
		a[i] += i;
	}
	sort(a.begin()+1, a.begin()+1+n, greater<int>());

	vector<int>cnt(n+5), dep(n+5);
	dep[0] = -1;
	auto dfs = [&](auto self, int u, int fa) -> void {
		dep[u] = dep[fa] + 1;
		cnt[dep[u]]++;
		for(auto v : g[u]) if(v != fa) {
			self(self, v, u);
		}
	};
	dfs(dfs, 1, 0);

 	int d = 0, ans = 0;
	for(int i = 1;i <= n;i++){
		ans = max(ans, a[i] + d);
		if(--cnt[d] == 0) d++;
	}
	cout << ans << endl;
}

signed main(){

	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while(t--) solve();

	return 0;
}