#include<bits/stdc++.h>
using namespace std;
namespace my_std{
#define mems(x,y) memset(x,y,sizeof x)
#define Mp make_pair
#define eb emplace_back
#define gc getchar
#define pc putchar
#define fi first
#define se second
#define il inline
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define drep(i,a,b) for(int i=(a);i>=(b);i--)
#define go(i,u) for(int i=head[u];i;i=e[i].nxt)
	typedef long long ll;
	typedef pair<int,int> pii;
	template<typename T>
	il void read(T &x){
		int f=1;x=0;char c=gc();
		while(c<'0'||c>'9'){
			if(c=='-'){
				f=-1;
			}
			c=gc();
		}
		while(c>='0'&&c<='9'){
			x=x*10+c-48,c=gc();
		}
		x*=f;
	}
	template<typename T,typename ...Args>
	void read(T &x,Args &...args){
		read(x),read(args...);
	}
	template<typename T>
	il void write(T x){
		char buf[43];int len=0;
		if(x<0){
			pc('-'),x=-x;
		}
		do{
			buf[++len]=x%10,x/=10;
		}while(x);
		while(len){
			pc(buf[len--]+'0');
		}
	}
}
using namespace my_std;
const int N=5e5+7,M=-1,inf=0x3f3f3f3f,mod=0;
int n,m,dp[N],c[N];
int tot,head[N];
struct node{
	int to,nxt;
}e[N];
il void add(int u,int v){
	e[++tot]={v,head[u]},head[u]=tot;
}
void dfs(int u){
	if(!head[u]){
		dp[u]=c[u]?1:-1;
		return;
	}
	go(i,u){
		int v=e[i].to;
		dfs(v),dp[u]+=dp[v];
	}
	if(dp[u]>0){
		dp[u]++;
	}else if(dp[u]<0){
		dp[u]--;
	}else{
		dp[u]+=n&1?1:-1;
	}
}
void Yorushika(){
	read(n);
	tot=0;
	rep(i,1,n){
		head[i]=dp[i]=0;
	}
	rep(i,2,n){
		int u;read(u);
		add(u,i);
	}
	rep(i,1,n){
		read(c[i]);
	}
	dfs(1);
	puts(dp[1]>0?"Bob":"Alice");
}
signed main(){
	int t=1;
	read(t,t);
	while(t--){
		Yorushika();
	}
}