#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;

const int MAXN = 200011;
struct DSU {
  int fa[MAXN];
  void init(int n) {
    for (int i = 1; i <= n; ++i) fa[i] = i;
  }
  int find(int x) {
    if (fa[x] == x) return x;
    return fa[x] = find(fa[x]);
  }
  void uni(int x, int y) {
    if (!x || !y) return;
    x = find(x), y = find(y);
    fa[x] = y;
  }
} dsu;
int a[MAXN], n;
vector<int> seq[MAXN];
int it[MAXN], dep[MAXN];
bool check(int lim) {
  // log("check lim = %d\n", lim);
  dsu.init(n + 1);
  for (int i = 1; i <= n; ++i) it[i] = 0;
  for (int i = 1; i <= n; ++i) {
    int d = lim - i - a[i] + 1;
    d = min(n, d);
    // log("i=%d,d=%d\n", i, d);
    d = dsu.find(d);
    while (d > 1 && it[d] == seq[d].size()) dsu.uni(d, d - 1), d = dsu.find(d);
    if (it[d] == seq[d].size()) return 0;
    ++it[d];
    if (it[d] == seq[d].size()) dsu.uni(d, d - 1);
  }
  return 1;
}
int main() {
#ifdef memset0
  freopen("A.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  int task;
  cin >> task;
  while (task--) {
    // log("new round\n");
    cin >> n;
    for (int i = 1; i <= n; ++i) dep[i] = 0;
    for (int i = 1; i <= n + 1; ++i) seq[i].clear();
    dep[1] = 1, seq[1].emplace_back(1);
    for (int i = 2; i <= n; ++i) {
      int x;
      cin >> x;
      dep[i] = dep[x] + 1;
      seq[dep[i]].emplace_back(i);
    }
    for (int i = 1; i <= n; ++i) cin >> a[i];
    int l = 0, r = 1e9; // temp
    while (l < r) {
      int mid = (l + r) >> 1;
      if (check(mid)) r = mid;
      else
        l = mid + 1;
    }
    cout << l << '\n';
    for (int i = 1; i <= n + 1; ++i) seq[i].clear();
  }
  return 0;
}