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

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

void solve() {
    int n;
    cin >> n;
    vector<vector<int>> adj(n + 1);
    for (int v = 2; v <= n; v++) {
        int u;
        cin >> u;
        adj[u].push_back(v);
    }

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] += i;
    }

    vector<int> dep(n + 1);
    auto dfs = [&](auto dfs, int u) -> void {
        for (auto& v : adj[u]) {
            dep[v] = dep[u] + 1;
            dfs(dfs, v);
        }
    };
    dfs(dfs, 1);

    sort(a.begin() + 1, a.end());
    sort(dep.begin() + 1, dep.end());
    reverse(dep.begin() + 1, dep.end());

    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, a[i] + dep[i]);
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}