#include<bits/stdc++.h>
using namespace std;
const int MAXN=4e5+5;
struct FenwickTree {
	int tr[MAXN],s,q[MAXN]; vector <int> e;
	void add(int x,int z) {
		e.push_back(++x),q[x]+=z;
		for(;x<MAXN;x+=x&-x) tr[x]+=z;
	}
	int v(int x) { return q[++x]; }
	int qry(int x) { for(s=0,++x;x;x&=x-1) s+=tr[x]; return s; }
	void clr() {
		for(int x:e) for(q[x]=0;x<MAXN;x+=x&-x) tr[x]=0;
		e.clear();
	}
}	S;
int n,col[MAXN],sg[MAXN][2][2]; //sg(u,subset of {0,1})
vector <int> G[MAXN];
int mex(int k) {
	int l=0,r=n+1,res=r;
	while(l<=r) {
		int mid=(l+r)>>1;
		if((mid+1)-S.qry(mid)>=k) res=mid,r=mid-1;
		else l=mid+1;
	}
	return res;
}
void W(int u,int x,int y) {
	S.add(0,x),S.add(1,y);
	for(int v:G[u]) {
		int cx=S.v(0),cy=S.v(1);
		int k=sg[v][S.v(0)][S.v(1)]+1,g=(k<=2)?k-1:mex(k-cx-cy);
		if(!S.v(g)) S.add(g,1);
	}
	sg[u][x][y]=mex(1),S.clr();
}
void B(int u,int x,int y) {
	int s=(y<<1)|x;
	for(int v:G[u]) s=sg[v][s&1][s>>1]?2:1;
	sg[u][x][y]=s&1;
}
signed main() {
//	freopen("Genshin_lmpact.in","r",stdin);
//	freopen("Genshin_lmpact.out","w",stdout);
	int ans=0,k;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&col[i]);
	for(int i=1;i<=n;++i) {
		int m; scanf("%d",&m),G[i].resize(m);
		if(!m) col[i]=1;
		for(int &j:G[i]) scanf("%d",&j);
		reverse(G[i].begin(),G[i].end());
	}
	for(int i=n;i>=1;--i) for(int x:{0,1}) for(int y:{0,1}) col[i]?W(i,x,y):B(i,x,y);
	scanf("%d",&k);
	for(int i;k--;) scanf("%d",&i),ans^=sg[i][1][0];
	puts(ans?"Alice":"Bob");
	return 0;
}