#include <bits/stdc++.h>
#define rfor(i,l,r) for(int i=l;i<=r;i++)
#define irfor(i,r,l) for(int i=r;i>=l;i--)
#define y1 qwertyuioplkjhgfdsazxcvbnm
#define ls(p) p<<1
#define rs(p) p<<1|1
#define mkp make_pair
using namespace std;typedef long long ll;typedef long double ld;typedef unsigned long long ull;typedef pair<int,int> pii;
inline ll read(){ll x=0,f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}return x*f;}
inline ll qpow(ll a,ll b,ll p){ll ans=1;while(b){if(b&1)ans=ans*a%p;a=a*a%p;b>>=1;}return ans;}
const int N = 4e5+5,mod=1e9+7;
struct BIT
{
	int n,a[N];
	inline int lbt(int x){return x&(-x);}
	inline void add(int x,int y){for(;x<=n;x+=lbt(x))a[x]+=y;}
	inline int kth(int k)
	{
		int now = 0;
		for(int i=__lg(n);i >= 0;i--)
			if(now+(1<<i)<= n && (1<<i)-a[now+(1<<i)] < k)
				k -= (1<<i)-a[now+(1<<i)],now += (1<<i);
		return now + 1;
	}
}bit;
int n,c[N],m[N];
vector<int> adj[N];
int sg[N][4];
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	n = read();bit.n = n*2;
	rfor(i,1,n) c[i] = read();
	rfor(i,1,n)
	{
		m[i] = read();
		rfor(j,1,m[i]) adj[i].push_back(read());
		reverse(adj[i].begin(),adj[i].end());
	}
	irfor(i,n,1)
		rfor(p,0,3)
			if(c[i] == 0)
			{
				int t = p;
				for(int v:adj[i]) t = (sg[v][t]?2:1);
				sg[i][p] = (t<3?(t&1):2);
			}
			else
			{
				vector<int> ntag;
				int t = p;
				for(int v:adj[i])
				{
					int tsg = sg[v][t];
					if(tsg < 2) t |= (1<<tsg);
					else tsg = bit.kth(tsg-1),bit.add(tsg,1),ntag.push_back(tsg);
				}
				sg[i][p] = (t<3?(t&1):bit.kth(1)+1);
				for(int v:ntag) bit.add(v,-1);
			}
	int k=read(),Xor = 0;
	while(k--) Xor ^= sg[read()][1];
	puts(Xor?"Alice":"Bob");
	return 0;
}