#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long N = 1e5 + 10;
const long long big = 1e18;
const long long block = 500;
const long long mod = 1e9 + 7;
long long t;
long long n, a, b, da, db;
vector<long long> g[N];
long long gl[N];
void dfs(long long v, long long p = 0) {
  gl[v] = gl[p] + 1;
  for (auto u : g[v])
    if (u != p) dfs(u, v);
}
long long dia() {
  pair<long long, long long> mx = {0, 0};
  for (long long i = 1; i <= n; i++) mx = max(make_pair(gl[i], i), mx);
  dfs(mx.second);
  mx = {0, 0};
  for (long long i = 1; i <= n; i++) mx = max(make_pair(gl[i], i), mx);
  mx.first--;
  return mx.first;
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  for (int i = 1; i <= n; i++) {
    gl[i] = 0;
    while (g[i].size()) g[i].pop_back();
  }
  for (int i = 1, z, d; i < n; i++) {
    cin >> z >> d;
    g[z].push_back(d);
    g[d].push_back(z);
  }
  dfs(a);
  long long rst = gl[b] - 1;
  if (rst <= da) {
    cout << "Alice\n";
    return;
  }
  long long z = min(db, dia());
  if (z > 2 * da)
    cout << "Bob\n";
  else
    cout << "Alice\n";
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> t;
  while (t--) {
    solve();
  }
}
