#include<bits/stdc++.h>
#define ll int
using namespace std;
ll C,t,n;
ll head[500005],cnt,c[500005];
struct ed
{
	ll v,next;
}edge[1000005];
void add(ll u,ll v)
{
	edge[++cnt].v=v;edge[cnt].next=head[u];head[u]=cnt;
//	edge[++cnt].v=u;edge[cnt].next=head[v];head[v]=cnt;
}
ll dp[(1<<20)][2];
ll sz[500005][2];
void dsf(ll id)
{
	sz[id][0]=sz[id][1]=0;
	if(!head[id])
	{
		++sz[id][c[id]];return;
	}
	for(ll i=head[id];i;i=edge[i].next)
	{
		ll v=edge[i].v;
		dsf(v);
		sz[id][0]+=sz[v][0];
		sz[id][1]+=sz[v][1];
	}
	if(sz[id][0]>sz[id][1])c[id]=0;
    else if (sz[id][1]>sz[id][0])c[id]=1;
    else c[id]=(n&1);
    ++sz[id][c[id]];
}
struct px
{
	ll ws,bs,uid;
	bool operator<(const px&b)const
	{
		return (ws-bs!=b.ws-b.bs)?(ws-bs<b.ws-b.bs):((ws^b.ws)?ws<b.ws:uid<b.uid);
	}
};
set<ll>w,b;
set<px>wb;
void add(ll id)
{
	if(sz[id][0]&&sz[id][1])
	wb.insert((px){sz[id][0],sz[id][1],id});
	else if(sz[id][0])w.insert(id);
	else b.insert(id);
}
int main()
{
//	freopen("alphago.in","r",stdin);
//	freopen("alphago.out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>t;
	while(t--)
	{
		cin>>n;cnt=0;
		for(ll i=1;i<=n;++i)head[i]=0;
		ll u;
		for(ll i=2;i<=n;++i)cin>>u,add(u,i);
		for(ll i=1;i<=n;++i)cin>>c[i];
		dsf(1);
		add(1);
		ll ls=-1;
		for(ll i=1;i<=n;++i)
		{
			if(i&1)
			{
				if(b.size())
				{
					ll now=*b.begin();b.erase(b.begin());
						for(ll i=head[now];i;i=edge[i].next)add(edge[i].v);
						ls=now;
				}
				else if(wb.size())
				{
					px now=*wb.begin();wb.erase(wb.begin());
					for(ll i=head[now.uid];i;i=edge[i].next)add(edge[i].v);
					ls=now.uid;
				}
				else
				{
					ll now=*w.begin();w.erase(w.begin());
					for(ll i=head[now];i;i=edge[i].next)add(edge[i].v);
					ls=now;
				}
			}
				else
				{
					if(w.size())
					{
						ll now=*w.begin();w.erase(w.begin());
						for(ll i=head[now];i;i=edge[i].next)add(edge[i].v);
						ls=now;
					}
				else if(wb.size())
				{
					px now=*wb.rbegin();
					wb.erase(wb.find(now));
					for(ll i=head[now.uid];i;i=edge[i].next)add(edge[i].v);
					ls=now.uid;
				}
				else
				{
					ll now=*b.begin();b.erase(b.begin());
					for(ll i=head[now];i;i=edge[i].next)add(edge[i].v);
					ls=now;
				}
			}
		}
		if(c[ls])cout<<"Bob\n";
		else cout<<"Alice\n";
	}
}//小 C 尽可能取黑棋，大 C 尽可能取白棋
//先写个指数级暴力看看？ 
//好像只有叶子节点的 col 和树的结构是 useful 的？
//只有第一个定下来的点是会影响我后面更新状态的！ 
//乱贪一下试试？
//统计 纯白子树、杂交子树、纯黑子树的个数 
//布什各门，怎么 TM 又能过所有大样例？？？