#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 998244353;
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll c, ll d) { return c / GCD(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
V<V<int>> g;
int ma, id;
int a, b;
int dd;
void dfs(int cur, int par, int cnt) {
  for (int v : g[cur]) {
    if (v == par) continue;
    dfs(v, cur, cnt + 1);
  }
  if (chmax(ma, cnt)) id = cur;
  if (cur == b - 1) dd = cnt;
}
void solve() {
  int n, da, db;
  ma = 0;
  cin >> n >> a >> b >> da >> db;
  g = V<V<int>>(n);
  int u, v;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    --u;
    --v;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  id = 0;
  dfs(0, -1, 0);
  ma = 0;
  dfs(id, -1, 0);
  int dist = ma;
  ma = 0;
  dd = 0;
  dfs(a - 1, -1, 0);
  if (dd <= da || 2 * da >= db || 2 * da >= dist) {
    cout << "Alice"
         << "\n";
    return;
  } else {
    cout << "Bob"
         << "\n";
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
}
