#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;

static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(int x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}

int n,f[N],c[N],sz[2][N];
vector<int> e[N];

void dfs(int u){
	if(e[u].size()){
		for(int v:e[u]) dfs(v),sz[0][u]+=sz[0][v],sz[1][u]+=sz[1][v];
		if(sz[0][u]^sz[1][u]) c[u]=sz[0][u]<sz[1][u];
		else c[u]=(n&1);
	}
	++sz[c[u]][u];
}

void solve(){
	n=wrd();
	for(int i=1;i<=n;++i) e[i].clear(),sz[0][i]=sz[1][i]=0;
	for(int i=2;i<=n;++i) f[i]=wrd(),e[f[i]].push_back(i);
	for(int i=1;i<=n;++i) c[i]=wrd();
	dfs(1),puts(!c[1]?"Alice":"Bob");
}

signed main(){
	int T=wrd();
	while(T--) solve();
	return 0;
}