#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 2e6 + 10;
map<int, int> tree;
int d[100000], a[100000];
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        for (int i = 2; i <= n; i++)
        {
            int x;
            cin >> x;
            d[i] = d[x] + 1;
        }
        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
            a[i] += i;
        }
        sort(d + 1, d + 1 + n);
        sort(a + 1, a + 1 + n);
        int ans = 0;
        for (int i = 1; i <= n; i++)
        {
            ans = max(ans, a[i] + d[n - i + 1]);
        }
        cout << ans<<'\n';
    }
}