#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
int n, a, b, da, db;
vector<vector<int>> graph(N);
vector<int> distance_from_a(N);
int diameter;
int dfs(int v, int parent) {
  int length = 0;
  for (int w : graph[v])
    if (w != parent) {
      distance_from_a[w] = distance_from_a[v] + 1;
      int current = 1 + dfs(w, v);
      diameter = max(diameter, current + length);
      length = max(length, current);
    }
  return length;
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  --a, --b;
  for (int j = 0; j < n; ++j) graph[j].clear();
  for (int i = 0; i < n - 1; ++i) {
    int x, y;
    cin >> x >> y;
    --x, --y;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
  distance_from_a[a] = 0;
  diameter = 0;
  dfs(a, -1);
  bool Alice = false;
  if (distance_from_a[b] <= da)
    Alice = true;
  else if (diameter <= 2 * da)
    Alice = true;
  else if (db <= 2 * da)
    Alice = true;
  cout << (Alice ? "Alice" : "Bob") << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  ;
  int t;
  cin >> t;
  while (t-- > 0) solve();
  return 0;
}
