#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
struct qw {
  int u, v, next;
  long long w;
} side[N];
int n, m;
int head[N], flag[N];
long long dpa[N], dpb[N], ans[N];
int sum[N];
void add(int u, int v, int w, int idx) {
  side[++idx].u = u;
  side[idx].v = v;
  side[idx].w = w;
  side[idx].next = head[u];
  head[u] = idx;
}
void dfs(int idx, int fa) {
  for (int i = head[idx]; i != -1; i = side[i].next) {
    int v = side[i].v, w = side[i].w;
    if (v == fa) continue;
    dfs(v, idx);
    if (dpa[idx] < dpa[v] + w)
      flag[idx] = v, dpb[idx] = dpa[idx], dpa[idx] = dpa[v] + w;
    if (dpb[idx] < dpa[v] + w && flag[idx] != v) dpb[idx] = dpa[v] + w;
  }
}
void init() {
  memset(head, -1, sizeof(int) * (n + 5));
  memset(flag, 0, sizeof(int) * (n + 5));
  memset(dpa, 0, sizeof(long long) * (n + 5));
  memset(dpb, 0, sizeof(long long) * (n + 5));
  memset(ans, 0, sizeof(long long) * (n + 5));
}
int dfs1(int u, int fa, int pos) {
  memset(flag, 0, sizeof(int) * (n + 5));
  memset(sum, 0, sizeof(int) * (n + 5));
  flag[u] = 1;
  queue<int> p;
  p.push(u);
  while (!p.empty()) {
    u = p.front();
    p.pop();
    if (u == pos) return sum[pos];
    for (int i = head[u]; i != -1; i = side[i].next) {
      int v = side[i].v;
      if (!flag[v]) sum[v] = sum[u] + 1, flag[v] = 1, p.push(v);
    }
  }
  return sum[pos];
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int da, db, a, b;
    scanf("%d%d%d%d%d", &n, &a, &b, &da, &db);
    init();
    for (int i = 1; i < n; i++) {
      int u, v;
      scanf("%d%d", &u, &v);
      add(u, v, 1, i * 2 - 1);
      add(v, u, 1, i * 2);
    }
    dfs(1, -1);
    long long ans = 0;
    for (int i = 1; i <= n; i++) ans = max(ans, dpa[i] + dpb[i]);
    int ls = dfs1(a, 0, b), ls1 = 1;
    if (ls > da && ans > da * 2 && db > da * 2) ls1 = 0;
    if (ls1)
      printf("Alice\n");
    else
      printf("Bob\n");
  }
  return 0;
}
