#include <bits/stdc++.h>
using namespace std;
const long long lmt = 1e5 + 5;
long long n, a, b, da, db, t, lvl[lmt];
vector<long long> adj[lmt];
void dfs(long long u, long long p) {
  for (long long v : adj[u]) {
    if (v == p) continue;
    lvl[v] = lvl[u] + 1;
    dfs(v, u);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    for (long long i = 1; i < n; i++) {
      long long u, v;
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    bool yes = 0;
    if (da * 2 >= db) yes = 1;
    lvl[a] = 0;
    dfs(a, -1);
    if (lvl[b] <= da) yes = 1;
    long long far = a;
    for (long long i = 1; i <= n; i++) {
      if (lvl[far] < lvl[i]) far = i;
    }
    lvl[far] = 0;
    dfs(far, -1);
    long long dia = 0;
    for (long long i = 1; i <= n; i++) {
      dia = max(dia, lvl[i]);
    }
    if (2 * da >= dia) {
      yes = 1;
    }
    for (long long i = 1; i <= n; i++) {
      adj[i].clear();
    }
    if (yes) {
      cout << "Alice"
           << "\n";
    } else {
      cout << "Bob"
           << "\n";
    }
  }
}
