// Author: Klay Thompson
// Problem: A. 报复社会
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 500010;

int n, a[maxn], fa[maxn], d[maxn];
vector<int> e[maxn];

void dfs(int u) {
  if (!SZ(e[u])) {
    if (a[u]) d[u] = -1;
    else d[u] = 1;
    return;
  }
  d[u] = 0;
  for (int v : e[u]) {
    dfs(v), d[u] += d[v];
  }
  if (d[u] < 0) a[u] = 1;
  else if (d[u] > 0) a[u] = 0;
  else a[u] = n & 1;
  if (a[u]) d[u]--;
  else d[u]++;
}

void work() {
  cin >> n;
  rep (i, 1, n) e[i].clear();
  rep (i, 2, n) cin >> fa[i], e[fa[i]].emplace_back(i);
  rep (i, 1, n) cin >> a[i];
  dfs(1);
  cout << (a[1] ? "Bob" : "Alice") << '\n';
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}