#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
int n, a, b, da, db;
vector<int> Adj[300005];
int f[300005], f2[300005], g[300005], d[300005];
void dfs(int u, int pre) {
  for (auto &v : Adj[u]) {
    if (v != pre) {
      d[v] = d[u] + 1;
      dfs(v, u);
      if (f[u] < f[v] + 1) {
        f2[u] = f[u];
        f[u] = f[v] + 1;
      } else
        f2[u] = max(f2[u], f[v] + 1);
    }
  }
}
void dfs2(int u, int pre) {
  for (auto &v : Adj[u]) {
    if (v != pre) {
      g[v] = g[u] + 1;
      if (f[u] == f[v] + 1)
        g[v] = max(g[v], f2[u] + 1);
      else
        g[v] = max(g[v], f[u] + 1);
      dfs2(v, u);
    }
  }
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  for (int i = 1; i <= n; i++) {
    Adj[i].clear();
    f[i] = f2[i] = g[i] = d[i] = 0;
  }
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    cin >> u >> v;
    Adj[u].push_back(v);
    Adj[v].push_back(u);
  }
  dfs(a, 0);
  dfs2(a, 0);
  int L = 0;
  for (int i = 1; i <= n; i++) L = max(L, f[i] + g[i]);
  if (d[b] <= da) {
    puts("Alice");
    return;
  }
  if (2 * da >= L) {
    puts("Alice");
    return;
  }
  if (2 * da >= db) {
    puts("Alice");
    return;
  }
  puts("Bob");
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
}
