#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,k;
int a[200005],r[200005];
vector <int> G[200005];
int dp[200005];

int main(){
	scanf("%d",&n);
	rep(u,1,n) scanf("%d",&a[u]);
	rep(u,1,n){
		int m,v;
		scanf("%d",&m);
		while(m--){
			scanf("%d",&v);
			G[u].eb(v);
		}
	}
	per(u,n,1){
		for(int v:G[u]) dp[u] ^= dp[v] ^ 1;
	}
	int ans = 0;
	scanf("%d",&k);
	rep(i,1,k){
		scanf("%d",&r[i]);
		ans ^= dp[r[i]] ^ 1;
	}
	if(ans) printf("Bob\n");
	else printf("Alice\n"); 
	return 0;
}