#include <bits/stdc++.h>
using namespace std;
#define GC()	getchar()
#define PC(x)	putchar(x)
int n, a[500010], fa[500010], hd[500010], nxt[500010];
struct A{
	int fl, x;
};
int read(){
	int res = 0;
	char c;
	do c = GC();
	while(c < '0' || c > '9');
	while(c >= '0' && c <= '9'){
		res = (res << 3) + (res << 1) + c - '0';
		c = GC();
	}
	return res;
}
int dfs(int u){
	int v, x = 0;
	if(hd[u] == 0) return 1 - (a[u] << 1);
	for(v = hd[u]; v > 0; v = nxt[v]){
		x += dfs(v);
	}
	if(x < 0 || (x == 0 && n & 1)) x--;
	else x++;
	return x;
}
void solve(){
	int i;
	A ans;
	n = read();
	for(i = 1; i <= n; i++) hd[i] = 0;
	for(i = 2; i <= n; i++){
		fa[i] = read();
		nxt[i] = hd[fa[i]]; hd[fa[i]] = i;
	}
	for(i = 1; i <= n; i++) a[i] = read(); 
	if(dfs(1) > 0){  PC('A'); PC('l'); PC('i'); PC('c'); PC('e'); }
	else{ PC('B'); PC('o'); PC('b'); }
	PC('\n');
}
int main()
{
	int t;
	t = read();
	while(t--) solve();
	return 0;
}