#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int INF = 0x3f3f3f3f;
struct ED {
  int pre, id;
} ed[maxn];
int tot, head[maxn];
void add(int u, int v) {
  ed[++tot].id = v;
  ed[tot].pre = head[u];
  head[u] = tot;
}
int FA = 0;
int root, dep[maxn], mx = 0;
void dfs(int u, int fa) {
  for (int i = head[u]; i; i = ed[i].pre) {
    int v = ed[i].id;
    if (v == fa) continue;
    dep[v] = dep[u] + 1;
    dfs(v, u);
  }
  if (dep[root] < dep[u]) root = u;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    root = 0;
    int a, b, da, db, n;
    tot = 0;
    scanf("%d %d %d %d %d", &n, &a, &b, &da, &db);
    for (int i = 1; i <= n; i++) head[i] = 0;
    for (int i = 1; i < n; i++) {
      int u, v;
      scanf("%d %d", &u, &v);
      add(u, v);
      add(v, u);
    }
    dep[a] = 0;
    dfs(a, 0);
    mx = dep[b];
    int tmp = root;
    root = 0;
    dep[tmp] = 0;
    dfs(tmp, 0);
    int dia = dep[root];
    if (mx <= da || (da * 2 >= db) || (da * 2 >= dia)) {
      printf("Alice\n");
    } else {
      printf("Bob\n");
    }
  }
  return 0;
}
