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

const int N = 100005;

vector<int> adj[N];
int a[N], n, ans, cur;

void dfs(int u, int dep) {
    ans = max(ans, dep + a[++cur]);
    for (auto v: adj[u]) {
        dfs(v, dep + 1);
    }    
}

void sc() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) adj[i].clear();    
    for (int i = 1; i < n; i++) {
        int fa; scanf("%d", &fa);
        adj[fa].push_back(i + 1);
    }
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        a[i] += i;
    }
    sort(a + 1, a + n + 1, greater<int> ());
    ans = 0, cur = 0, dfs(1, 0);
    printf("%d\n", ans);
}

int main() {
    int T; scanf("%d", &T);
    while (T--) sc();
    return 0;
}