#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using ul = uint64_t;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pi>;
static constexpr int inf = (int)1e9 + 5;
static constexpr ll infl = (ll)1e18 + 5;
static constexpr ll M = (ll)1e9 + 7;
static mt19937 rng((uint32_t)chrono::duration_cast<chrono::nanoseconds>(
                       chrono::high_resolution_clock::now().time_since_epoch())
                       .count());
void dfs(int v, vi &dist, vvi &adj) {
  for (auto &e : adj[v]) {
    if (dist[e] < inf) continue;
    dist[e] = dist[v] + 1;
    dfs(e, dist, adj);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  int ___;
  cin >> ___;
  while (___--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    a--;
    b--;
    vvi adj(n);
    for (int i = 0; i < (n - 1); ++i) {
      int u, v;
      cin >> u >> v;
      --u;
      --v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    vi dist(n, inf);
    dist[a] = 0;
    dfs(a, dist, adj);
    if (da >= db || dist[b] <= da) {
      cout << "Alice" << '\n';
      continue;
    }
    int m = 0;
    for (int i = 0; i < (n); ++i)
      if (dist[i] > dist[m]) m = i;
    dist.assign(n, inf);
    dist[m] = 0;
    dfs(m, dist, adj);
    if (*max_element((dist).begin(), (dist).end()) <= 2 * da) {
      cout << "Alice" << '\n';
      continue;
    }
    if (db > 2 * da) {
      cout << "Bob" << '\n';
      continue;
    }
    cout << "Alice" << '\n';
  };
  return 0;
}
