#include<bits/stdc++.h>
using namespace std;

vector<int>eg[1000010];
int v, u, ans = INT_MAX;
int n, fa[1000010], a[1000010], dep[1000010];

void dfs(int x, int fa,int deep){
	dep[x] = deep;
	for(auto c:eg[x]){
		if(c == fa)continue;
		dfs(c, x, deep + 1);
	}
}

void solve(){
	cin >> n;
	for(int i = 1; i <= n; ++i){
		eg[i].clear();
	}
	for(int i = 2; i <= n; ++i){
		cin >> v;
		eg[v].emplace_back(i);
	}
	for(int i = 1; i <= n; ++i){
		cin >> a[i];
		a[i] += i;
	}
	
	dfs(1, 1, 0);
	
	sort(a + 1, a + 1 + n);
	sort(dep + 1, dep + 1 + n, greater<int>());
	
	int ans = INT_MIN;
	for(int i = 1; i <= n; ++i){
		ans = max(ans, dep[i] + a[i]);
	}
	
	cout << ans << "\n";
}
signed main(){
	 ios::sync_with_stdio(false);
	 
	 int _ = 1;
	 cin >> _;
	 while(_--){
	 	solve();
	 }
}
//2
//3
//1 1
//1 3 2
//3
//1 2
//1 3 2