#include <bits/stdc++.h>
#define eb emplace_back
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
bool Mbe;

const int N = 5e5 + 5;
int n, c[N], f[N];
vector<int> g[N];

int sgn(int x) {
	return x > 0 ? 1 : -1;
}

void dfs(int u) {
	if (!g[u].size()) return f[u] = (c[u] ? -1 : 1), void();
	f[u] = 0;
	for (int v : g[u]) dfs(v), f[u] += f[v];
	if (!f[u]) f[u] += (n & 1) ? -1 : 1;
	else f[u] += (f[u] > 0) ? 1 : -1;
}

void solve() {
	cin >> n;
	for (int i = 1; i <= n; i++) g[i].clear();
	for (int i = 2, x; i <= n; i++) 
		cin >> x, g[x].eb(i);
	for (int i = 1; i <= n; i++) cin >> c[i];
	dfs(1);
	if (f[1] > 0) cout << "Alice\n";
	else cout << "Bob\n";
}

// #define FILE

bool Med;
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cerr << (&Mbe - &Med) / 1048576.0 << " MB\n";
	#ifdef FILE
		freopen("alphago.in", "r", stdin);
		freopen("alphago.out", "w", stdout);
	#endif
	int T = 1;
	cin >> T;
	while (T--) solve();
	cerr << (int)(1e3 * clock() / CLOCKS_PER_SEC) << " ms\n";
	return 0;
}