#include <bits/stdc++.h>
using namespace std;
int n, A, B, da, db;
int max_dist(vector<int> *a, int i, int p, int &maxx) {
  int count = 0;
  int largest = 0, second = 0;
  for (auto it : a[i]) {
    if (it == p) continue;
    int temp = max_dist(a, it, i, maxx);
    if (temp > largest) {
      largest = temp;
      second = largest;
    } else if (temp > second) {
      second = temp;
    }
    count++;
  }
  if (count == 0)
    return 0;
  else if (count == 1) {
    maxx = max(maxx, largest + 1);
  } else {
    maxx = max(maxx, largest + second + 2);
  }
  return largest + 1;
}
void dfs(vector<int> *a, vector<int> &d, int i, int p) {
  for (auto it : a[i]) {
    if (it == p) continue;
    d[it] = d[i] + 1;
    dfs(a, d, it, i);
  }
}
void solve() {
  cin >> n >> A >> B >> da >> db;
  vector<int> a[n + 1];
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  if (db <= 2 * da) {
    cout << "Alice\n";
    return;
  }
  vector<int> dist(n + 1);
  dfs(a, dist, A, 0);
  if (dist[B] <= da) {
    cout << "Alice\n";
    return;
  }
  int ptr = A;
  for (int i = 1; i <= n; i++) {
    if (dist[ptr] < dist[i]) {
      ptr = i;
    }
  }
  dist[ptr] = 0;
  dfs(a, dist, ptr, 0);
  int maxx = 0;
  for (int i = 1; i <= n; i++) {
    maxx = max(maxx, dist[i]);
  }
  if (maxx <= 2 * da) {
    cout << "Alice\n";
  } else
    cout << "Bob\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
