#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct edge {
  int to, nxt;
} ln[maxn << 1];
int lst[maxn], tt;
inline void add(int u, int v) {
  ++tt;
  ln[tt].to = v;
  ln[tt].nxt = lst[u];
  lst[u] = tt;
}
int mx, mxd, a, b, dab;
inline int dfs(int u, int F, int dis) {
  if (mx < dis) {
    mx = dis;
    mxd = u;
  }
  if (u == b) dab = dis;
  for (register int i = lst[u]; i; i = ln[i].nxt) {
    int v = ln[i].to;
    if (v != F) dfs(v, u, dis + 1);
  }
  return mx;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n, da, db;
    scanf("%d%d%d%d%d", &n, &a, &b, &da, &db);
    for (register int i = 1; i < n; i++) {
      int x, y;
      scanf("%d%d", &x, &y);
      add(x, y);
      add(y, x);
    }
    mx = 0;
    dfs(a, 0, 0);
    int ndab = dab;
    mx = 0;
    dfs(mxd, 0, 0);
    db = min(db, mx);
    if (db <= da * 2 || ndab <= da)
      puts("Alice");
    else
      puts("Bob");
    tt = 0;
    for (register int i = 1; i <= n; i++) lst[i] = 0;
  }
  return 0;
}
