#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> dep(n + 1);
        for(int i = 2; i <= n; i++){
            int p;
            cin >> p;
            dep[i] = dep[p] + 1;
        }
        sort(dep.begin() + 1, dep.end());
        vector<int> a(n + 1);
        for(int i = 1; i <= n; i++){
            cin >> a[i];
            a[i] += i;
        }
        sort(a.begin() + 1, a.end());
        int ans = 0;
        for(int i = 1; i <= n; i++){
            ans = max(ans, dep[i] + a[n - i + 1]);
        }
        cout << ans << '\n';
    }

}