#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 500100;

int n, a[maxn], f[maxn];
vector<int> G[maxn];

void dfs(int u) {
	if (G[u].empty()) {
		f[u] = (a[u] ? -1 : 1);
		return;
	}
	f[u] = 0;
	for (int v : G[u]) {
		dfs(v);
		f[u] += f[v];
	}
	if (f[u] > 0) {
		++f[u];
	} else if (f[u] < 0) {
		--f[u];
	} else if (n & 1) {
		--f[u];
	} else {
		++f[u];
	}
}

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		vector<int>().swap(G[i]);
	}
	for (int i = 2, p; i <= n; ++i) {
		scanf("%d", &p);
		G[p].pb(i);
	}
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	dfs(1);
	puts(f[1] > 0 ? "Alice" : "Bob");
}

int main() {
	// freopen("alphago.in", "r", stdin);
	// freopen("alphago.out", "w", stdout);
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}