#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=N*4+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,c[N],f[N][2][2];vector<int> S[N];
namespace bit{
	int f[N];
	void add(int x,int w){while(x<=2*n+1) f[x]+=w,x+=x&-x;}
	int qry(int x){int y=0;for(int i=18;~i;i--) if(y+(1<<i)<=2*n+1&&f[y+(1<<i)]<x) x-=f[y+=1<<i];return y+1;}
}
vector<int> adds;int ap[N];
void add(int x,int w){
	if(!ap[x]) bit::add(x+1,-1);
	ap[x]+=w;adds.emplace_back(x);
	if(!ap[x]) bit::add(x+1,1);
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&c[i]);
	for(i=1;i<=n;i++){
		int x,y;scanf("%d",&x);
		while(x--) scanf("%d",&y),S[i].emplace_back(y);
		reverse(S[i].begin(),S[i].end());
	}
	for(i=0;i<=n;i++) bit::add(i+1,1);
	for(i=n;i;i--){
		for(int o1=0;o1<2;o1++){
			for(int o2=0;o2<2;o2++){
				if(o1) add(0,1);if(o2) add(1,1);
				for(int j:S[i]) {
					int w=f[j][ap[0]>0][ap[1]>0];
					if(w>=2) w=bit::qry(w-(ap[0]>0)-(ap[1]>0)+1)-1;
					if(!c[i]) {
						for(int h:adds) if(ap[h]) ap[h]=0,bit::add(h+1,1);
						adds.clear();
					}
					add(w,1);
				}
				f[i][o1][o2]=bit::qry(1)-1;
				for(int h:adds) if(ap[h]) ap[h]=0,bit::add(h+1,1);adds.clear();
			}
		}
		// cerr<<f[i][1][0]<<'\n';
	}
	int k,tot=0;scanf("%d",&k);
	while(k--){
		int x;scanf("%d",&x);
		tot^=f[x][1][0];
	}
	puts(tot?"Alice":"Bob");
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}