//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int p[22],c[22],dp[1<<20];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=2;i<=n;i++)
			cin>>p[i];
		for(int i=1;i<=n;i++)
			cin>>c[i];
		for(int i=0;i<(1<<n);i++)
		{
			if(!i) continue;
			if(__builtin_popcount(i)==1)
			{
				dp[i]=c[__lg(i)+1];
				continue;
			}
			if((n-__builtin_popcount(i))&1)
			{
				dp[i]=0;
				for(int j=0;j<n;j++)
					if(i>>j&1)
						if(j==0||!(i>>(p[j+1]-1)&1))
							dp[i]=max(dp[i],dp[i^(1<<j)]);
			}
			else
			{
				dp[i]=1;
				for(int j=0;j<n;j++)
					if(i>>j&1)
						if(j==0||!(i>>(p[j+1]-1)&1))
							dp[i]=min(dp[i],dp[i^(1<<j)]);
			}
		}
		cout<<(dp[(1<<n)-1]?"Bob":"Alice")<<'\n';
	}
	return 0;
}