#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int a[200005];
vector <int> ch[200005];

int N = 1,tree[400005],tp[400005],_cur;
#define lowbit(x) (x & (-x))
void fix(int pos){
	if(tp[pos] > _cur) tree[pos] = 0;
	tp[pos] = _cur;	
}
void upd(int pos,int C){
	while(pos <= N){
		fix(pos);
		tree[pos] += C;
		pos += lowbit(pos);
	}
}

int qry(int pos){
	int ret = 0;
	while(pos){
		fix(pos);
		ret += tree[pos];
		pos -= lowbit(pos);
	}
	return ret;
}

int kth(int k){
	int pos = 0;
	per(_k,17,0){
		if(pos + (1 << _k) <= N){
			fix(pos + (1 << _k));
			if(k > (1 << _k) - tree[pos + (1 << _k)]){
				pos += 1 << _k;
				k -= (1 << _k) - tree[pos];
			}
		}
	}
	return pos + 1;
}

int dp[200005][4];
void solve2(int u){//u 是白点
	rep(S,0,3){
		_cur--;
		int cur = S,temp;
		for(int v:ch[u]){
			temp = dp[v][cur];
			if(temp <= 1) cur |= (1 << temp);
			else upd(kth(temp),1);
		}
		if((cur & 1) == 0) dp[u][S] = 0;
		else if((cur & 2) == 0) dp[u][S] = 1;
		else dp[u][S] = kth(2);
 	}
}

void solve1(int u){
	assert(0);
}

int main(){
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	scanf("%d",&n);
	rep(u,1,n) scanf("%d",&a[u]);
	rep(u,1,n){
		int sz;
		scanf("%d",&sz);
		N += sz;
		ch[u].resize(sz);
		rep(j,0,sz - 1) scanf("%d",&ch[u][j]);
		reverse(ch[u].begin(),ch[u].end());
	}

	per(u,n,1){
		if(!a[u]) solve1(u);
		else solve2(u);
	}

	int k,id,answer = 0;
	scanf("%d",&k);
	while(k--){
		scanf("%d",&id);
		answer ^= dp[id][1];
	}
	if(!answer) printf("Bob\n");
	else printf("Alice\n");
	return 0;
}