#include<iostream>
#include<cstdio>
#include<vector>
#include<cassert>
#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 n,k,lg[N+1],cl[N+1],c[N+1],SG[N+1][2][2],dp[N+1],cnt[N+1],res;
vector<int>E[N+1];
int lowbit(int x)
{
    return x&(-x);
}
void add(int x,int d)
{
    for (;x<=N;x+=lowbit(x)) c[x]+=d;
    return;
}
int query(int x)
{
    int res=0,d=0;
    for (int i=lg[N];i>=0;--i)
	if (d+(1<<i)<=N&&d+(1<<i)-(res+c[d+(1<<i)])<x)
	    d+=(1<<i),res+=c[d];
    return d+1;
}
int main()
{
    bool opt,opt2;
    int rt,t,x;
    for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
    n=read();
    for (int i=1;i<=n;++i) cl[i]=read();
    for (int i=1;i<=n;++i)
    {
	t=read();
	while (t--) x=read(),E[i].push_back(x);
    }
    for (int i=n;i>=1;--i)
    {
	for (int op=0;op<=1;++op)
	    for (int op2=0;op2<=1;++op2)
	    {
		if (cl[i])
		{
		    if (op) cnt[0]++;
		    if (op2) cnt[1]++;
		    for (int j=(int)(E[i].size())-1;j>=0;--j)
		    {
			dp[j]=query(SG[E[i][j]][cnt[0]>0][cnt[1]>0]+1)-1;
			cnt[dp[j]]++;
			if (dp[j]>=2&&cnt[dp[j]]==1) add(dp[j]+1,1);
		    }
		    if (cnt[0]) add(1,1);
		    if (cnt[1]) add(2,1);
		    SG[i][op][op2]=query(1)-1;
		    if (cnt[0]) add(1,-1);
		    if (cnt[1]) add(2,-1);
		    if (op) cnt[0]--;
		    if (op2) cnt[1]--;
		    for (int j=0;j<E[i].size();++j)
		    {
			cnt[dp[j]]--;
			if (dp[j]>=2&&!cnt[dp[j]]) add(dp[j]+1,-1);
		    }
		}
		else
		{
		    opt=op,opt2=op2;
		    for (int j=(int)(E[i].size())-1;j>=0;--j)
		    {
			rt=SG[E[i][j]][opt][opt2];
			if (!rt) opt=1,opt2=0;
			else if (rt==1) opt=0,opt2=1;
			else opt=opt2=0;
		    }
		    if (opt)
		    {
			if (opt2) SG[i][op][op2]=2;
			else SG[i][op][op2]=1;
		    }
		    else SG[i][op][op2]=0;
		}
	    }
    }
    k=read();
    while (k--) x=read(),res^=SG[x][1][0];
    puts(res?"Alice":"Bob");
    return 0;
}