#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1e6 + 7;
int n;
int c[N];
vi e[N];
int dp[N], xdp[N];
map < int, int > DP[N];
inline int DFS(int x, int w) {
	if(DP[x].count(w)) return DP[x][w];
	if(c[x] == 0) {
		if(sz(e[x]) == 0) {
			int sg = 0;
			while(w >> sg & 1) ++sg;
			return DP[x][w] = sg;
		} else {
			w &= 1;
			int lst = w;
			R(i, sz(e[x]) - 1, 0) {
				lst = 1 << min(DFS(e[x][i], lst & 3), 3);
			}
			int sg = 0;
			while(lst >> sg & 1) ++sg;
			return DP[x][w] = sg;
		}
	} else {
		vi vc;
		L(i, 0, 30) if(w >> i & 1) {
			vc.emplace_back(i);
		}
		R(i, sz(e[x]) - 1, 0) {
			int S = sz(vc) && vc[0] == 0;
			int w = 0, sch = 0;
			if(c[e[x][i]] == 0) {
				if(sz(e[e[x][i]]) == 0) {
					w = 0, sch = 1;
				} else {
					w = DFS(e[x][i], S & 1), sch = 0;
				}
			} else { 
				w = DFS(e[x][i], S & 1), sch = 1;
				if(S & 1) --w;
			}
			if(sch) {
				int l = 0, r = sz(vc) - 1, ans = sz(vc);
				while(l <= r) {
					int mid = (l + r) >> 1;
					if(w < vc[mid] - mid) ans = mid, r = mid - 1;
					else l = mid + 1;
				} 
				w += ans;
			}
			auto pos = lower_bound(vc.begin(), vc.end(), w);
			if(pos == vc.end() || *pos != w) vc.insert(pos, w);
		}
		int sg = 0;
		while(sg < sz(vc) && vc[sg] == sg) ++sg;
		return DP[x][w] = sg;
	}
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) {
		cin >> c[i];
	}
	L(i, 1, n) {
		int m;
		cin >> m;
		while(m--) {
			int x;
			cin >> x;
			e[i].emplace_back(x);
		}
	}
	int k;
	cin >> k;
	
	int ans = 0;
	while(k--) {
		int x;
		cin >> x;
		ans ^= DFS(x, 1);
	}
	
//	cout<<"ans="<<ans<<endl;
	if(ans == 0) cout << "Bob\n";
	else cout << "Alice\n";
	return 0;
}