#include <bits/stdc++.h> 
using namespace std;
#define int long long
#define endl '\n'
#define base 191
#define mod 1145141
const int N = 1e7 + 10;
int n;
vector<int>edge[100010];
int sum[500010];
int vis[500010] = { 0 };
int tt[500010];
void solve() {
	cin >> n;
	
	for (int i = 1; i <= n - 1; ++i) {
		int u;
		cin >> u;
		edge[u].push_back(i + 1);
		edge[i + 1].push_back(u);
	}
	for (int i = 1; i <= n; ++i) {
		cin >> sum[i];
		sum[i] += i;
	}
	queue<int> q, qt;
	q.push(1);
	vis[1] = 1;
	qt.push(0);
	while (q.size()) {
		int x = q.front();
		int t = qt.front();
		tt[x] = t;
		q.pop();
		qt.pop();
		for (auto it : edge[x]) {
			if (vis[it] == 1) {
				continue;
			}
			vis[it] = 1;
			q.push(it);
			qt.push(t + 1);
		}
	}
	int maxx = 0;
	sort(sum + 1, sum + 1 + n);
	sort(tt + 1, tt + 1 + n, greater<int>());
	for (int i = 1; i <= n; ++i) {
		maxx = max(sum[i] + tt[i],maxx);
	}
	cout << maxx << endl;
	for (int i = 1; i <= n; ++i) {
		edge[i].clear();
		vis[i] = 0;
		tt[i] = 0;
	}
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
		
	}
}

/*2
3
1 1
1 3 2
3
1 2
1 3 2*/