#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 5e5 + 9;
int n, a[N], p[N], d[N];
vi g[N];

void dfs (int u, int f) {
  d[u] = 0;
  for (int v : g[u]) {
    if (g[v].empty()) {
      d[u] += 1 - 2 * a[v];
    }
  }
  vi w;
  for (int v : g[u]) {
    if (sz(g[v])) {
      dfs(v, u);
      w.eb(d[v]);
    }
  }
  sort(w.begin(), w.end());
  int l = 0, r = sz(w) - 1;
  while (l <= r) {
    if (d[u] <= 0) {
      d[u] += 1 + w[r--];
    } else {
      d[u] += -1 + w[l++];
    }
  }
}

void slv () {
  cin >> n;
  L (i, 2, n) {
    cin >> p[i];
    g[p[i]].eb(i);
  }
  L (i, 1, n) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << (a[1] ? "Bob" : "Alice") << '\n';
    return;
  }
  dfs(1, 0);
  cout << (d[1] > 0 ? "Alice" : "Bob") << '\n';
  L (i, 1, n) {
    g[i].clear();
  }
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    slv();
  }
}
// I love WHQ!