// Problem: # 8948. 报复社会
// URL: https://qoj.ac/problem/8948
// Writer: WRuperD
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")	
const int MAX = 5e5 + 10;

int n;
int col[MAX];
int cnt[MAX][2];
bool realcol[MAX];
vector <int> g[MAX];

void dfs(int u, int fa){
	cnt[u][0] = cnt[u][1] = 0;
	bool fl = 1;
	for(int v : g[u]){
		if(v == fa)	continue;
		dfs(v, u);
		fl = 0;
		cnt[u][0] += cnt[v][0], cnt[u][1] += cnt[v][1];
	}
	if(fl){
		cnt[u][col[u]]++;
		realcol[u] = col[u];
		return ;
	}
	if(cnt[u][0] > cnt[u][1]){
		cnt[u][0]++, realcol[u] = 0;
	}else if(cnt[u][1] > cnt[u][0]){
		cnt[u][1]++, realcol[u] = 1;
	}else{
		if(n % 2 == 0)	cnt[u][0]++, realcol[u] = 0;
		else cnt[u][1]++, realcol[u] = 1;	
	}
}

void solve(){
	n = read();
	for(int i = 2; i <= n; i++){
		int v = read();
		g[i].pb(v), g[v].pb(i);
	}
	for(int i = 1; i <= n; i++){
		col[i] = read();
	}
	dfs(1, 1);
	if(realcol[1])	puts("Bob");
	else puts("Alice");
	for(int i = 1; i <= n; i++)	g[i].clear();
}

signed main(){
	// freopen("alphago.in", "r", stdin);
	// freopen("alphago.out", "w", stdout);
	int t = read();
	while(t--)	solve();
	return 0;
}