#include <bits/stdc++.h>
const int N = 1e6 + 5;
const double pi = acosl(-1);
const long long inf = 1e18 + 5;
using namespace std;
template <typename T>
void debug(string s, T x) {
  cout << s << " = " << x << "\n";
}
template <typename T, typename... Args>
void debug(string s, T x, Args... args) {
  cout << s.substr(0, s.find(',')) << " = " << x << " | ";
  debug(s.substr(s.find(',') + 2), args...);
}
template <class T>
void print_container(T &container) {
  for (auto &t : container) {
    cout << t << " ";
  }
  cout << "\n";
}
template <class T>
void print_pair_container(T &container) {
  for (auto &t : container) {
    cout << t.first << " " << t.second << "\n";
  }
  cout << "\n";
}
template <class T>
void printArr(T &a, int n) {
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
int n, a, b, da, db;
vector<int> adj[N];
bool visited[N];
int dist[N];
void bfs(int x) {
  queue<int> q;
  q.push(x);
  dist[x] = 0;
  while (!q.empty()) {
    int t = q.front();
    q.pop();
    visited[t] = 1;
    for (int u : adj[t]) {
      if (!visited[u]) {
        q.push(u);
        dist[u] = dist[t] + 1;
      }
    }
  }
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  a--, b--;
  for (int i = 0; i <= n; i++) {
    adj[i].clear();
    visited[i] = 0;
  }
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  bfs(0);
  int idx_far = max_element(dist, dist + n) - (dist);
  for (int i = 0; i < n; i++) {
    visited[i] = 0;
  }
  bfs(idx_far);
  int diameter = *max_element(dist, dist + n);
  for (int i = 0; i < n; i++) {
    visited[i] = 0;
  }
  bfs(a);
  int dist_ab = dist[b];
  if (dist_ab <= da) {
    cout << "Alice\n";
    return;
  }
  if (db <= 2 * da) {
    cout << "Alice\n";
    return;
  }
  if (diameter <= 2 * da) {
    cout << "Alice\n";
    return;
  }
  cout << "Bob\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
