#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=5e5+5,M=(1<<28)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,p[N],col[N];
vector<int> S[N];
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) S[i].clear();
	for(int i=2;i<=n;i++) scanf("%d",&p[i]);
	for(int i=1;i<=n;i++) scanf("%d",&col[i]);
	for(int i=2;i<=n;i++) S[p[i]].push_back(i);
	if(n==1){
		puts(col[1]?"Bob":"Alice");
		return;
	}
	int c1=0,c2=0;
	deque<pii> q;
	for(int i=2;i<=n;i++){
		if(S[i].empty()){
			if(col[i]) c2++;
			else c1++;
			continue;
		}
		q.emplace_back(0,0);
		for(int j:S[i]){
			if(col[j]) q.back().se++;
			else q.back().fi++;
		}
	}
	sort(all(q),[](pii x,pii y){return x.fi-x.se<y.fi-y.se;});
	for(int i=2;i<=n;i++){
		if(i&1){
			if(c2){c2--;continue;}
			if(q.empty()){
				puts("Alice");
				return;
			}
			c1+=q.front().fi;c2+=q.front().se;q.pop_front();
		}else{
			if(c1){c1--;continue;}
			if(q.empty()){
				puts("Bob");
				return;
			}
			c1+=q.back().fi;c2+=q.back().se;q.pop_back();
		}
	}
	puts(n&1?"Bob":"Alice");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}