#include <bits/stdc++.h>
using namespace std;
const long long N = 2e6 + 5;
const long long M = 5005;
const long long mod = 998244353;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long ksm(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1) ret = (ret * x) % mod;
    x = (x * x) % mod;
    y >>= 1;
  }
  return ret;
}
long long Q;
long long n, a, b, da, db;
vector<long long> T[N];
void add(long long u, long long v) {
  T[u].push_back(v);
  T[v].push_back(u);
}
long long disa[N], dis1[N];
void dfs(long long u, long long fa, long long dis[]) {
  for (long long i = 0; i < T[u].size(); i++) {
    long long v = T[u][i];
    if (v == fa) continue;
    dis[v] = dis[u] + 1;
    dfs(v, u, dis);
  }
}
signed main() {
  Q = read();
  while (Q--) {
    n = read();
    a = read();
    b = read();
    da = read();
    db = read();
    for (long long i = 1; i <= n; i++) T[i].clear();
    for (long long i = 1; i < n; i++) {
      long long u, v;
      u = read();
      v = read();
      add(u, v);
    }
    if (2 * da >= db) {
      puts("Alice");
      continue;
    }
    disa[a] = 0;
    dfs(a, 0, disa);
    if (disa[b] <= da) {
      puts("Alice");
      continue;
    }
    long long id = 0;
    for (long long i = 1; i <= n; i++)
      if (disa[i] > disa[id]) id = i;
    dis1[id] = 0;
    dfs(id, 0, dis1);
    long long maxn = 0;
    for (long long i = 1; i <= n; i++) maxn = max(maxn, dis1[i]);
    if (da * 2 >= maxn) {
      puts("Alice");
      continue;
    }
    puts("Bob");
  }
}
