#include <bits/stdc++.h>
using namespace std;
vector<int> adj[100010];
void solve() {
  int n, a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  for (long long i = 1; i < n + 1; i++) adj[i].clear();
  vector<int> in(n + 1, 0);
  for (long long i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
    in[x]++;
    in[y]++;
  }
  vector<long long> dist(n + 1, INT_MAX);
  queue<int> q;
  q.push(b);
  dist[b] = 0;
  while (!q.empty()) {
    int bro = q.front();
    q.pop();
    for (auto j : adj[bro]) {
      if (dist[j] == INT_MAX) {
        dist[j] = 1 + dist[bro];
        q.push(j);
      }
    }
  }
  int maxi = 0, node = -1;
  for (long long i = 1; i < n + 1; i++) {
    if (dist[i] > maxi) {
      maxi = dist[i];
      node = i;
    }
  }
  if (dist[a] <= da) {
    cout << "Alice\n";
    return;
  }
  for (long long i = 1; i < n + 1; i++) dist[i] = INT_MAX;
  long long total = 0;
  q.push(node);
  dist[node] = 0;
  while (!q.empty()) {
    int bro = q.front();
    q.pop();
    for (auto j : adj[bro]) {
      if (dist[j] == INT_MAX) {
        dist[j] = 1 + dist[bro];
        total = max((long long)total, dist[j] + 1);
        q.push(j);
      }
    }
  }
  if (total <= 2 * da + 1) {
    cout << "Alice\n";
    return;
  }
  if (db > 2 * da) {
    cout << "Bob\n";
    return;
  }
  cout << "Alice\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
