#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n;
int fa[21],a[21];

inline int chk(int S,int p){
	return (S >> p) & 1;
}
int dp[1 << 21];//[0] Alice,[1] Bob
void solve(){
	scanf("%d",&n);
	rep(u,1,n - 1){
		scanf("%d",&fa[u]);
		fa[u]--;
	}
	rep(u,0,n - 1) scanf("%d",&a[u]);
	rep(S,1,(1 << n) - 1){
		if(popcnt(S) == 1){
			dp[S] = a[ctz(S)];
			continue;
		}
		int op = (__builtin_parity(S) == n % 2);
		if(op) dp[S] = 1;
		else dp[S] = 0;
		rep(i,0,n - 1){
			if(!chk(S,i) || (i && chk(S,fa[i]))) continue;
			if(op) chkmin(dp[S],dp[S - (1 << i)]);
			else chkmax(dp[S],dp[S - (1 << i)]);
		}
	}
	if(dp[(1 << n) - 1]) printf("Bob\n");
	else printf("Alice\n");
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}