#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];
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);
		}
	}
	R(i, n, 1) {
		if(c[i] == 0) {
			R(j, sz(e[i]) - 1, 0) 
				dp[i] ^= dp[e[i][j]] ^ 1;
			dp[i] &= 1;
		} else {
			vi vc;
			R(j, sz(e[i]) - 1, 0) {
				int w = dp[e[i][j]];
				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;
				vc.insert(lower_bound(vc.begin(), vc.end(), w), w);
			}
			dp[i] = 0;
			while(dp[i] < sz(vc) && vc[dp[i]] == dp[i]) ++dp[i];
		}
	}
	
//	L(i, 1, n) {
//		cout << dp[i] << ' ';
//	}
//	cout << endl;
	int k;
	cin >> k;
	
	int ans = 0;
	while(k--) {
		int x;
		cin >> x;
		if(c[x]) ans ^= dp[x] + 1;
		else ans ^= dp[x] ^ 1;
	}
	if(ans == 0) cout << "Bob\n";
	else cout << "Alice\n";
	return 0;
}