#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
vector<int> tree[N];
int c[N],val[N];
int n;
void dfs(int u,int fath){
	if(tree[u].size()-(fath!=0)==0){
		val[u]=c[u]?1:-1;
		return ;
	}
	for(int v:tree[u]){
		if(v==fath) continue;
		dfs(v,u);
		val[u]+=val[v];                                                                                                                                                                                                                                                                                                                                                                                                                                                    
	}
	if(val[u]<0) val[u]--;
	if(val[u]>0) val[u]++;
	if(val[u]==0){
		if(n%2) val[u]++;
		else val[u]--;
	}
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		val[i]=0;
		tree[i].clear();
	}
	for(int i=1;i<n;i++){
		int u;cin>>u;
		tree[i+1].push_back(u);
		tree[u].push_back(i+1);
	}
	for(int i=1;i<=n;i++){
		cin>>c[i];
	}
	dfs(1,0);
	cout<<(val[1]<0?"Alice":"Bob")<<"\n";
}
int main(){
//	freopen("game.in","r",stdin);
//	freopen("game.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T;cin>>T;
	while(T--){
		solve();
	}
}