#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 10);
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
bool isPrime(long long N) {
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
long long cbrt(long long x) {
  long long lo = 1, hi = min(2000000ll, x);
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    if (mid * mid * mid < x) {
      lo = mid;
    } else
      hi = mid;
  }
  if (hi * hi * hi <= x)
    return hi;
  else
    return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
const long long nax = (long long)(100000 + 10);
vector<string> v;
vector<long long> vec[300005], adj[300005], aa, pri, pri1;
long long INF = 10000000000000000;
set<long long> st;
string ss;
long long a, b, c, d, n, m, da, db, k = 0, f = 0, mm = 0, h = 0, t, res = 0,
                                    tmp = 0, flag = 1, s, x, src, root = 1;
long long vis[400004], dp[5005][5005], dep[400005], dis[400005], val[300005];
map<pair<long long, long long>, long long> mp, ab;
void dfs(long long u, long long p) {
  vis[u] = 1;
  dep[u] = dep[p] + 1;
  if (dep[u] > mm) {
    mm = dep[u];
    res = u;
  }
  for (auto &i : adj[u]) {
    if (!vis[i]) {
      dfs(i, u);
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    for (long long i = 1; i <= n + 2; i++) {
      adj[i].clear();
      vis[i] = 0;
      dep[i] = 0;
    }
    res = 0;
    mm = 0;
    for (long long i = 1; i <= n - 1; i++) {
      cin >> k >> f;
      adj[k].push_back(f);
      adj[f].push_back(k);
    }
    if (da * 2 >= db) {
      cout << "Alice"
           << "\n";
      continue;
    }
    dfs(a, 0);
    if (dep[b] - dep[a] <= da) {
      cout << "Alice"
           << "\n";
      continue;
    }
    for (long long i = 1; i <= n + 2; i++) {
      dep[i] = 0;
      vis[i] = 0;
    }
    mm = 0;
    dfs(res, 0);
    if (dep[res] - 1 <= 2 * da) {
      cout << "Alice"
           << "\n";
      continue;
    }
    cout << "Bob"
         << "\n";
  }
}
