#include<bits/stdc++.h>
#define LL long long

using namespace std;

const int N = 1e5 + 10;

int T;
int n , a[N], d[N];

template <typename T> inline void read(T &x) {
	T f = 1; char c = getchar(); x = 0;
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -1;
	for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
	x *= f;
}

template <typename T> inline void chkmax(T &x , T y) {x = x > y ? x : y; }
template <typename T> inline void chkmin(T &x , T y) {x = x < y ? x : y; }

template <typename T> inline void print(T x) {
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> inline void write(T x , char c) {
	if (x < 0) {x = -x; putchar('-'); }
	print(x);
	putchar(c);
}

int main() {

	read(T);
	while(T--) {
		read(n);
		d[1] = 0;
		for (int i = 1; i < n; i++) {
			int x;
			read(x);
			d[i + 1] = d[x] + 1;
		}
		for (int i = 1; i <= n; i++) {
			read(a[i]);
			a[i] = a[i] + i;
		}
		sort(a + 1 , a + n + 1);
		sort(d + 1 , d + n + 1);
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			chkmax(ans , a[i] + d[n - i + 1]);
		}
		write(ans, '\n');
	}

	return 0;

}