#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node {
    int to, nxt;
} e[1000005];

int head[500005], cnt;
void add(int fa, int son) {
    e[++cnt].to = son;
    e[cnt].nxt = head[fa];
    head[fa] = cnt;
}
int T, n;
int wn[500005], siz[500005], sizn[500005], sizx[500005], a[500005];
void dfs(int x, int fa) {
    siz[x] = 1;
    int flg = 0;
    for (int i = head[x]; i; i = e[i].nxt) {
        int v = e[i].to;
        if (v == fa)
            continue;
        flg = 1;
        dfs(v, x);
        siz[x] += siz[v];
        sizn[x] += sizn[v];
        sizx[x] += sizx[v];
    }
    if (flg == 0) {
        if (a[x] == 0)
            sizn[x] = 1, wn[x] = 1;
        else
            sizx[x] = 1, wn[x] = 0;
    } else {
        if (sizn[x] > sizx[x])
            wn[x] = 1, sizn[x]++;
        else if (sizn[x] < sizx[x])
            wn[x] = 0, sizx[x]++;
        else {
            int nw = n - siz[x] + 1;
            if (nw % 2 == 1)
                wn[x] = 0, sizx[x]++;
            else
                wn[x] = 1, sizn[x]++;
        }
    }
}
void solve() {
    cin >> n;
    for (int i = 2; i <= n; i++) {
        int v;
        cin >> v;
        add(i, v), add(v, i);
    }
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    dfs(1, 0);
    if (wn[1] == 1)
        cout << "Alice" << endl;
    else
        cout << "Bob" << endl;
    for (int i = 1; i <= n; i++)
        head[i] = a[i] = siz[i] = sizx[i] = sizn[i] = wn[i] = 0;
    for (int i = 1; i <= cnt; i++)
        e[i].to = e[i].nxt = 0;
    cnt = 0;
}
signed main() {
//    freopen("alphago.in", "r", stdin);
//    freopen("alphago.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int c;
    cin >> T;
    while (T--)
        solve();
    return 0;
}