#include<bits/stdc++.h>
#define N 500010
using namespace std;
inline bool Isdigit(char c){return c>='0'&&c<='9';}
template<typename T>inline T read(){
    T x=0;bool F=0;
    char c=getchar();
    while(!Isdigit(c)){if(c=='-')F=1;c=getchar();}
    while(Isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
    return F?-x:x;
}
int c,T,n,cnt,head[N],siz[N],col[N],To[N],Nxt[N];
void Init(){
    cnt=0;
    for(int i=1;i<=n;i++)
        head[i]=siz[i]=0;
}
void add(int from,int to){
    To[++cnt]=to;
    Nxt[cnt]=head[from];
    head[from]=cnt;
}
void dfs(int now){
    for(int i=head[now];i;i=Nxt[i]){
        dfs(To[i]);
        siz[now]+=siz[To[i]];
    }
    if(!head[now])return siz[now]=col[now]?1:-1,void();
    if(siz[now]<0)siz[now]--;
    else if(siz[now]>0)siz[now]++;
    else siz[now]+=(n&1)?1:-1;
}
void solve(){
    n=read<int>(),Init();
    for(int i=2;i<=n;i++)add(read<int>(),i);
    for(int i=1;i<=n;i++)col[i]=read<int>();
    dfs(1);
    puts(siz[1]>0?"Bob":"Alice");
}
int main(){
    // freopen("alphago.in","r",stdin);
    // freopen("alphago.out","w",stdout);
    scanf("%d",&T);
    while(T--)solve();
}