#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
#define all(x) (x).begin(),(x).end()
using namespace std;
inline LL read(){
  LL q=0,w=1;char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
inline void writeln(LL x){write(x);puts("");}
inline void writecs(LL x){write(x);putchar(' ');}

inline void dmin(LL &x,LL y){if(x>y)x=y;return ;}
inline void dmax(LL &x,LL y){if(x<y)x=y;return ;}

#define cout cerr
#define pb push_back

const LL N = 500000+95 ;
LL n,fa[N],col[N];vector<LL>E[N];

namespace sub1{
  map<vector<LL>,LL>MP;
  LL dfs(vector<LL>x,LL op){//op=0:Alice操作;op=1:Bob操作.
    sort(all(x));
    if(MP.find(x)!=MP.end())return MP[x];
    LL ok[2]={0,0};
    for(auto u:x){
      vector<LL>y;for(auto v:x)if(u!=v)y.pb(v);
      for(auto v:E[u])y.pb(v);
      if(!SZ(y))return col[u];
      ok[dfs(y,op^1)]=1;
    }
    if(op==0){LL u=((ok[0])?(0):(1));MP[x]=u;return u;}
    if(op==1){LL u=((ok[1])?(1):(0));MP[x]=u;return u;}
    assert(0);return -1;
  }
  void solve(){
    MP.clear();LL ans=dfs({1},0);
    if(!ans)puts("Alice");
    else puts("Bob");
    return ;
  }
}

namespace sub2{
  bool check(){
    for(LL t=1;t<=n;t++){
      if(t==1)continue;
      if(fa[t]==1)continue;
      if(fa[fa[t]]==1)continue;
      return 0;
    }
    return 1;
  }
#define PL pair<LL,LL>
#define mp make_pair
#define fir first
#define sec second
  deque<PL>st;
  void solve(){
    LL cnt[2]={0,0};
    for(LL t=2;t<=n;t++){
      if(!SZ(E[t])){
	if(fa[t]==1)cnt[col[t]]++;
      }
      else {
	LL c[2]={0,0};
	for(auto x:E[t])c[col[x]]++;
	st.pb(mp(c[0],c[1]));
      }
    }
    sort(all(st),[&](PL x,PL y){return (x.fir-x.sec)>(y.fir-y.sec);});
    /*    auto pr=[&](LL tmp){
	      if(tmp==0)puts("Alice");
	      else puts("Bob");
	      return ;
	    };*/
    LL op=1;//,tmp=-1;
    while(true){
      //      cout<<" -> op = "<<op<<" cnt[0] = "<<cnt[0]<<" cnt[1] = "<<cnt[1]<<" st : ";
      //      for(auto u:st)cout<<" ("<<u.first<<","<<u.second<<") ";
      //      cout<<endl;
      if(op==0){//Alice
	if(cnt[1]){cnt[1]--;/*tmp=1;*/op^=1;continue;}
	if(!SZ(st)){puts("Alice");break;}
	PL u=st.back();st.pop_back();//选对方最多者,消耗对方
	cnt[0]+=u.fir;cnt[1]+=u.sec;
      }
      else {//Bob
	if(cnt[0]){cnt[0]--;/*tmp=0;*/op^=1;continue;}
	if(!SZ(st)){puts("Bob");break;}
	PL u=st.front();st.pop_front();
	cnt[0]+=u.fir;cnt[1]+=u.sec;
      }
      op^=1;
    }
    return ;
  }
}

int main(){
  LL TC=read();
  while(TC--){
    n=read();
    for(LL t=1;t<=n;t++)E[t].clear();
    for(LL t=2;t<=n;t++){fa[t]=read();E[fa[t]].pb(t);}
    for(LL t=1;t<=n;t++)col[t]=read();
    if(n<=20){
      sub1::solve();
      continue;
    }
    if(sub2::check()){
      sub2::solve();
      continue;
    }
  }
  return 0;
}
/*
my test data:
input:
1
3
1 2 
0 0 0 
output:
Alice

input:
1
6
1 2 1 4 4 
1 1 1 1 0 1 
output:
Bob

input:
1
6
1 1 2 3 2 
0 1 1 0 0 1 
output:
Alice
*/