#include <bits/stdc++.h>
using namespace std;
void initialize(long long n);
void oj() {}
long long n, a, b, da, db;
vector<long long> v[200005], dist(200005);
bool vis[200005];
void dfs(long long x, long long d) {
  vis[x] = true;
  dist[x] = d;
  for (auto el : v[x])
    if (!vis[el]) dfs(el, d + 1);
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  for (long long i = 0; i < n - 1; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(a, 0);
  if (dist[b] <= da) {
    cout << "Alice" << endl;
    initialize(n);
    return;
  }
  long long maxi = max_element(dist.begin(), dist.end()) - dist.begin();
  memset(vis, false, sizeof(vis));
  dfs(maxi, 0);
  maxi = *max_element(dist.begin(), dist.end());
  if (min(db, maxi) <= 2 * da)
    cout << "Alice" << endl;
  else
    cout << "Bob" << endl;
  initialize(n);
}
signed main() {
  oj();
  ios::sync_with_stdio(0);
  cin.tie(0);
  ;
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
void initialize(long long n) {
  for (long long i = 1; i <= n; i++) {
    v[i].clear();
    vis[i] = false;
    dist[i] = 0;
  }
}
