#include <cstdio>
#include <string>
#include <algorithm>
#define i128 __int128
#define i64 long long
#define uit unsigned int
#define ull unsigned i64
template <class T> bool chkmax(T &x,T y){ return x<y?x=y,true:false; }
template <class T> bool chkmin(T &x,T y){ return x>y?x=y,true:false; }
using namespace std;
namespace io{
    #define file(s,x)\
        freopen(#s#x".in","r",stdin);\
        freopen(#s".out","w",stdout);
    const int SIZE=1<<21;
    short plc[50],rof=0;
    char ibuf[SIZE],*p1=ibuf,*p2=ibuf,obuf[SIZE],*p3=obuf;
    #define flush() (fwrite(obuf,1,p3-obuf,stdout),p3=obuf)
    #define gc() (p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,SIZE,stdin),p1==p2)?EOF:*p1++)
    #define pc(ch) (p3==obuf+SIZE&&flush(),*p3++=ch)
    class Flush{ public: ~Flush(){ flush(); } }_;
    template <class T> inline void read(T &x){
        x=0; bool flag=true; char c=gc();
        while(!isdigit(c)){ if(c=='-') flag=false; c=gc(); }
        while(isdigit(c)){ x=(x<<1)+(x<<3)+(c^48); c=gc(); }
        !flag&&(x=~(x-1));
    }
    inline void read(char &c){ while((c=gc())<'a'||c>'z'); }
    inline void read(string &s){
        s=""; char c; while((c=gc())<'a'||c>'z') ;
        s+=c; while((c=gc())>='a'&&c<='z') s+=c;
    }
    template <class T,class ...Args>
    inline void read(T &first,Args &...args){
        read(first);
        read(args...);
    }
    template <class T> inline void print(T x){
        x<0?pc('-'),x=-x:0;
        do plc[++rof]=x%10; while(x/=10);
        while(rof) pc(plc[rof--]|48);
    }
    inline void print(char c){ pc(c); }
    inline void print(string s){ for(char c : s) pc(c); }
    inline void print(const char *s){ print(string(s)); }
    template <class T,class ...Args>
    inline void print(T first,Args ...args){
        print(first);
        print(args...);
    }
}
using namespace io;
const int N=500100;
int T;
int n,p[N],c[N];
struct Edge{
    int to,next;
}edge[N];
int num,head[N];
void addEdge(int from,int to){
    num++;
    edge[num].to=to;
    edge[num].next=head[from];
    head[from]=num;
}
int dp[N];
void dfs(int x){
    if(!head[x]){
        dp[x]=(c[x]?-1:1);
        return;
    }
    dp[x]=0;
    for(int i=head[x];i;i=edge[i].next){
        int y=edge[i].to;
        dfs(y),dp[x]+=dp[y];
    }
    if(dp[x]<0) dp[x]--;
    else if(dp[x]>0) dp[x]++;
    else if(n&1) dp[x]--;
    else dp[x]++;
}
int main(){
    for(read(T);T;T--){
        read(n);
        for(int i=1;i<=n;i++)
            head[i]=0; num=0;
        for(int i=2;i<=n;i++)
            read(p[i]),addEdge(p[i],i);
        for(int i=1;i<=n;i++) read(c[i]);
        dfs(1);
        print(dp[1]>0?"Alice\n":"Bob\n");
    }
    return 0;
}