#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  vector<int> adj[n + 2];
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  int level[n + 4];
  int visited[n + 4];
  memset(visited, false, sizeof(visited));
  visited[a] = true;
  queue<int> q;
  q.push(a);
  level[a] = 0;
  int diameterSide1 = a;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    diameterSide1 = u;
    for (int i = 0; i < (int)adj[u].size(); i++) {
      int v = adj[u][i];
      if (!visited[v]) {
        visited[v] = true;
        level[v] = level[u] + 1;
        q.push(v);
      }
    }
  }
  if (level[b] <= da) {
    cout << "Alice\n";
    return;
  }
  level[diameterSide1] = 0;
  memset(visited, false, sizeof(visited));
  visited[diameterSide1] = true;
  int diameter = 0;
  q.push(diameterSide1);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    diameter = level[u];
    for (int i = 0; i < (int)adj[u].size(); i++) {
      int v = adj[u][i];
      if (!visited[v]) {
        visited[v] = true;
        level[v] = level[u] + 1;
        q.push(v);
      }
    }
  }
  if (diameter <= 2 * da || db <= 2 * da) {
    cout << "Alice\n";
    return;
  } else {
    cout << "Bob\n";
  }
  return;
}
int main() {
  int tc;
  cin >> tc;
  while (tc--) solve();
  return 0;
}
