#include<bits/stdc++.h>
#define Alex std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);
#define int long long
#define double long double
const int QAQ = 0;
const double eps = 1e-10;
const int mod = 1e9 + 7;
const int N = 1e7 + 10;
std::vector<int> G[500005];
int Dep[500005];
inline bool cmp(std::pair<int,int> x,std::pair<int,int> y)
{
	if(x.second < y.second) return true;else return false;
}
inline bool cmpp(int x,int y)
{
	return x > y;
}
inline void dfs(int u,int fa)
{
	Dep[u] = Dep[fa] + 1;
	for(auto v : G[u])
	{
		if(v == fa) continue;
		dfs(v,u);
	}
}
signed main()
{
	Alex;
	int _;
	_ = 1;
	std::cin>>_;
	while(_--)
	{
		int n;
		std::cin>>n;
		int f[n + 10],a[n + 10];
		std::pair<int,int> p[n + 10];
		for(int i = 0;i <= n + 1;i++) Dep[i] = 0;
		for(int i = 1;i <= n;i++) G[i].clear();
		for(int i = 1;i <= n - 1;i++) 
		{
			std::cin>>f[i];
			G[f[i]].push_back(i + 1);
			G[i + 1].push_back(f[i]);
		}
		for(int i = 1;i <= n;i++) std::cin>>a[i];
		for(int i = 1;i <= n;i++)
		{
			p[i].first = a[i];
			p[i].second = a[i] + i;
		}
		std::sort(p + 1,p + n + 1,cmp);
		dfs(1,0);
		std::sort(Dep + 1,Dep + n + 1,cmpp);
		int ans = 0;
		for(int i = 1;i <= n;i++) ans = std::max(ans,Dep[i] + p[i].second - 1);
		std::cout<<ans<<'\n';
	}
	return QAQ;
}