//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);}
const int useless=-1919810;
int t;
int n,p[500500],c[500500];
vector<int> G[500500];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	while(t--)
	{
		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=1;i<=n;i++)
			G[i].clear();
		for(int i=2;i<=n;i++)
			G[p[i]].pb(i);
		int tot=0;
		for(int i=n;i>=1;i--)
			if(!sz(G[i]))
				c[i]=(c[i]?1:-1);
			else
			{
				int x=0;
				int cc=0;
				int c2=0;
				for(auto j:G[i])
				{
					if(c[j]!=useless)
						x+=c[j];
					if(!c[j])
						cc++;
				}
				tot+=cc;
				if(x&&i>1)
					x+=x/abs(x);
				c[i]=x;
			}
		if(!c[1]) tot++;
		if(abs(c[1])>tot)
		{
			if(c[1]>=0)
				cout<<"Bob\n";
			else
				cout<<"Alice\n";
		}
		else
		{
			tot-=abs(c[1]);
			if(tot%2==0)
				cout<<"Bob\n";
			else
				cout<<"Alice\n";
		}
	}
	return 0;
}