#include <bits/stdc++.h>

using namespace std;

#ifdef lisie_bimbi
#else
#define endl '\n'
#endif
//#define int long long

vector<vector<int>> v;
vector<int> d;

void dfs(int u){
    for(auto i : v[u]){
        d[i] = d[u] + 1;
        dfs(i);
    }
}

void solve(){
    int n;
    cin >> n;
    v.clear();
    v.resize(n);
    d.clear();
    d.resize(n);
    d[0] = 0;
    for(int i = 0; i < n - 1; i++){
        int a;
        cin >> a;
        a--;
        v[a].push_back(i + 1);
    }
    dfs(0);
    sort(d.begin(), d.end());
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        a[i] += i + 1;
    }
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    int mx = 0;
    for(int i = 0; i < n; i++){
        mx = max(mx, a[i] + d[i]);
    }
    cout << mx << endl;
}

signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);    
#endif     
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}