#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
vector<long long> G[N];
long long n, a, b, da, db, ans, d = 0, diameter = 0;
long long dfs(long long node, long long par, long long dist) {
  if (node == b) d = dist;
  vector<long long> vec;
  for (auto nb : G[node]) {
    if (nb == par) continue;
    long long x = dfs(nb, node, dist + 1);
    vec.push_back(x);
  }
  sort(vec.rbegin(), vec.rend());
  if ((long long)(vec.size()) == 1) diameter = max(diameter, vec[0]);
  if ((long long)(vec.size()) > 1) diameter = max(diameter, vec[0] + vec[1]);
  return ((long long)(vec.size()) == 0) ? 1 : 1 + vec[0];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    ans = 0;
    diameter = 0;
    cin >> n >> a >> b >> da >> db;
    for (long long i = 1; i < n + 1; i++) {
      G[i].clear();
    }
    for (long long i = 0; i < n - 1; i++) {
      long long u, v;
      cin >> u >> v;
      G[v].push_back(u);
      G[u].push_back(v);
    }
    dfs(a, -1, 0);
    if (d <= da || 2 * da >= diameter) {
      cout << "Alice\n";
      continue;
    }
    if (db > 2 * da) {
      cout << "Bob\n";
      continue;
    } else {
      cout << "Alice\n";
      continue;
    }
  }
  return 0;
}
