#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], b[N], p[N], hd[N], tot;

struct {
  int v, nx;
} e[N * 2];

IL void add_edge (int u, int v) {
  e[++tot] = {v, hd[u]};
  hd[u] = tot;
}

void dfs (int u) {
  if (hd[u] == 0) {
    b[u] = 2 * a[u] - 1;
    return;
  }
  b[u] = 0;
  for (int i = hd[u], v; i; i = e[i].nx) {
    dfs(v = e[i].v);
    b[u] += b[v];
  }
  if (b[u] != 0) {
    b[u] += b[u] > 0 ? 1 : -1;
  } else {
    b[u] = n & 1 ? 1 : -1;
  }
}

void slv () {
  cin >> n;
  L (i, 2, n) {
    cin >> p[i];
    add_edge(p[i], i);
  }
  L (i, 1, n) {
    cin >> a[i];
  }
  dfs(1);
  cout << (b[1] <= 0 ? "Alice" : "Bob") << '\n';
  L (i, 1, n) {
    hd[i] = 0;
  }
  tot = 0;
}

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