#include <bits/stdc++.h>

using namespace std;

char rr[1 << 22], *csy1, *csy2;
#define GC (csy1 == csy2 && (csy2 = (csy1 = rr) + fread(rr, 1, 1 << 22, stdin), csy1 == csy2) ? EOF : *csy1 ++)

template <class T>
inline void RI(T &t) {
    char c = GC;
    for (t = 0; c < 48 || c > 57; c = GC);
    for ( ; c > 47 && c < 58; c = GC) t = t * 10 + (c ^ 48);
}

const int MAX_N = 100000 + 5;

int N, M, a[MAX_N], fa[MAX_N], son[MAX_N], bro[MAX_N], dep[MAX_N];

inline bool cmp(int i, int j) {return i + a[i] < j + a[j];}

void dfs(int u) {
    M = max(M, dep[u]);
    for (int v = son[u]; v; v = bro[v]) {
        dep[v] = dep[u] + 1; dfs(v);
    }
}

bool check(int mid) {
    static int cnt1[MAX_N], cnt2[MAX_N];
    memset(cnt1, M, sizeof(int) * (M + 1));
    memset(cnt2, M, sizeof(int) * (M + 1));
    for (int i = 1; i <= N; i ++) {
        cnt1[dep[i]] ++;
        int x = mid - i - a[i];
        if (x < 0) return false;
        cnt2[min(x, M)] ++;
    }
    if (cnt1[0] < cnt2[0]) return false;
    for (int i = 1; i <= M; i ++) {
        cnt1[i] += cnt1[i - 1];
        cnt2[i] += cnt2[i - 1];
        if (cnt1[i] < cnt2[i]) return false;
    }
    return true;
}

void solve() {
    memset(son, 0, sizeof(int) * (N + 1));
    
    RI(N);
    for (int i = 2; i <= N; i ++) {
        RI(fa[i]);
        bro[i] = son[fa[i]];
        son[fa[i]] = i;
    }
    M = 0; dfs(1);
    int l = 0x3f3f3f3f, r = 0;
    for (int i = 1; i <= N; i ++) {
        RI(a[i]);
        l = min(l, i + a[i]);
        r = max(r, i + a[i] + N);
    }
    while (l < r) {
        int mid = l + r >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }
    printf("%d\n", l);
}

int main() {
    int T;
    RI(T);
    while (T --) solve();
    return 0;
}