#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
using namespace std;
typedef double db;
typedef pair<int,int> pii;
typedef pair<db,db> pdd;
const int mod = 1e9 + 7;
const int inf = 1800000000000000000;
const int N = 1000005;
int n;
int a[N],f[N];
vector<int>v[N];
void dfs(int x,int fa){
	f[x] = f[fa] + 1;
	for(auto i:v[x]){
		if(i!=fa){
			dfs(i,x);
		}
	}
}
void solve(){
	int n;cin>>n;
	for(int i=1;i<=n;i++){
		v[i].clear();
	}
	for(int i=1;i<n;i++){
		int x;cin>>x;
		int y=i+1;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i]+=i;
	}
	f[0]=-1;
	dfs(1,0);
	sort(a+1,a+1+n);
	sort(f+1,f+1+n,greater<int>());
	int mi=a[1]+f[1];
	for(int i=1;i<=n;i++){
//		cout<<f[i]<<' '<<a[i]<<endl;
		mi=max(mi,f[i]+a[i]);
	}
	cout<<mi<<endl;
}
signed main(){
	IOS
	int T;cin>>T;
	while(T--){
		solve();
	}
}