#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const int MN = 2e5 + 5;
int T, N, K, dA, dB, aSt, bSt;
vector<int> adj[MN];
int dist[MN];
void dfs(int u, int p) {
  for (int v : adj[u]) {
    if (v == p) continue;
    dist[v] = dist[u] + 1;
    dfs(v, u);
  }
}
string solve() {
  cin >> N >> aSt >> bSt >> dA >> dB;
  for (int i = 1; i <= N; i++) {
    adj[i].clear();
  }
  for (int i = 1; i < N; i++) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  if (dA >= dB) {
    return "Alice";
  }
  dist[aSt] = 0;
  dfs(aSt, 0);
  if (dist[bSt] <= dA) {
    return "Alice";
  }
  pii mx{-1, -1};
  for (int i = 1; i <= N; i++) {
    mx = max(mx, {dist[i], i});
  }
  dist[mx.second] = 0;
  dfs(mx.second, 0);
  mx = {-1, -1};
  for (int i = 1; i <= N; i++) {
    mx = max(mx, {dist[i], i});
  }
  if (dA >= (mx.first + 1) / 2) return "Alice";
  if (dB <= 2 * dA) return "Alice";
  return "Bob";
}
int main() {
  cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
  cin >> T;
  while (T--) {
    cout << solve() << '\n';
  }
}
