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

const int N = 1e5 + 10;
int n;
vector<int> g[N];
int a[N];
vector<int> depth;

void dfs(int x, int father, int dep)
{
    depth.push_back(dep);
    for(auto &to : g[x])
    {
        if(to == father) continue;
        dfs(to, x, dep + 1);
    }
}

void solve()
{
    cin >> n;
    for(int i = 1; i <= n; i++) g[i].clear();
    for(int i = 1; i < n; i++)
    {
        int to;
        cin >> to;
        g[to].push_back(i + 1);
        g[i + 1].push_back(to);
    }
    for(int i = 1; i <= n; i++) cin >> a[i], a[i] += i;
    sort(a + 1, a + 1 + n);

    depth.clear();
    dfs(1, -1, 0);

    sort(depth.begin(), depth.end());

    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        // cerr << a[i] << ' ' << depth[n - i] << '\n';
        ans = max(ans, a[i] + depth[n - i]);
    }

    cout << ans << '\n';
}

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

    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}