#include<iostream>
#include<cstdio>
#include<vector>
#define N 500000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int T,n,sz[N+1],dp[N+1],c[N+1];
vector<int>E[N+1];
void add(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void dfs(int x)
{
	bool op=0;
	sz[x]=1;
	if (E[x].empty()) dp[x]=(!c[x])?1:-1;
	else
	{
		dp[x]=0;
		for (int i=0;i<E[x].size();++i)
		{
			dfs(E[x][i]),sz[x]+=sz[E[x][i]],dp[x]+=dp[E[x][i]];
			if (dp[E[x][i]]) op^=(sz[E[x][i]]&1);
		}
		if ((sz[x]&1)&&op)
		{
			if (dp[x]>0) dp[x]--;
			else if (dp[x]<0) dp[x]++;
		}
		else
		{
			if (dp[x]>0) dp[x]++;
			else if (dp[x]<0) dp[x]--;
		}
	}
	return;
}
int main()
{
	int x;
	T=read();
	while (T--)
	{
		n=read();
		for (int i=1;i<=n;++i) E[i].clear();
		for (int i=2;i<=n;++i) x=read(),E[x].push_back(i);
		for (int i=1;i<=n;++i) c[i]=read();
		dfs(1);
		if (dp[1]>0) puts("Alice");
	    else if (dp[1]<0) puts("Bob");
		else if (!(sz[1]&1)) puts("Alice");
		else puts("Bob");
	}
	return 0;
}