#include <bits/stdc++.h>
using namespace std;
const int sz = 2e5 + 5;
int dis[sz];
vector<int> g[sz];
void dfs(int u, int p, int lvl = 0) {
  dis[u] = lvl;
  for (int v : g[u])
    if (v ^ p) dfs(v, u, lvl + 1);
}
void solve() {
  int n, a, b, da, db;
  scanf("%d %d %d %d %d", &n, &a, &b, &da, &db);
  for (int i = 1; i <= n; i++) g[i].clear();
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(a, 0);
  int w = 1;
  for (int i = 1; i <= n; i++)
    if (dis[i] > dis[w]) w = i;
  if (dis[b] <= da) {
    puts("Alice");
    return;
  }
  dfs(w, 0);
  int dia = 0;
  for (int i = 1; i <= n; i++) dia = max(dia, dis[i]);
  da = min(dia, da);
  db = min(dia, db);
  if (db > 2 * da)
    puts("Bob");
  else
    puts("Alice");
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
}
