#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[500005],deg[500005],col[500005],a[500005];

set <int> S;
void solve(){
	scanf("%d",&n);
	fill(deg,deg + n + 1,0);
	fill(a,a + n + 1,0);
	rep(u,2,n){
		scanf("%d",&fa[u]);
		deg[fa[u]]++;
	}
	rep(u,1,n) scanf("%d",&col[u]);
	if(n == 1){
		if(!col[1]) printf("Alice\n");
		else printf("Bob\n");
		return;
	}
	rep(u,1,n){
		if(!deg[u]){
			if(!col[u]) a[fa[u]]++;
			else a[fa[u]]--;
		}
	}
	rep(u,1,n) if(fa[u] == 1 && deg[u]) S.insert(a[u]);

//	assert(S.empty());
	int cur = a[1],op = 1;
	while(!S.empty()){
		if(!op){
			if(cur < 0){
				cur++;
			}else{
				auto it = S.begin();
				cur += *it;
				S.erase(it);
			}
		}else{
			if(cur > 0){
				cur--;
			}else{
				auto it = prev(S.end());
				cur += *it;
				S.erase(it);
			}
		}
		op ^= 1;
	}
//	printf("cur=%d\n",cur);
	if(cur > 0 || (!cur && !op)) printf("Alice\n");
	else printf("Bob\n");
}

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