#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)9 + (int)1e9;
const int N = 100005;
const double PI = 4 * atan(1);
const double eps = 1e-10;
const long long oo = 1e10;
const int K = 26;
int t;
int n, a, b, da, db;
int u, v;
vector<long long> adj[N];
int dist[N];
bool vis[N];
int len = 0;
void dfs(int src, int par, int di) {
  dist[src] = di;
  for (auto t : adj[src]) {
    if (t == par) continue;
    dfs(t, src, di + 1);
  }
}
void dfs2(int src, int par) {
  int mi1 = 0;
  int mi2 = 0;
  for (auto t : adj[src]) {
    if (t == par) continue;
    dfs2(t, src);
    if (dist[t] > mi1) {
      mi2 = mi1;
      mi1 = dist[t];
    } else {
      mi2 = (mi2 > dist[t] ? mi2 : dist[t]);
    }
  }
  len = (len > mi1 + mi2 + 1 ? len : mi1 + mi2 + 1);
  dist[src] = mi1 + 1;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    a--;
    b--;
    for (int i = 0; i < n; i++) {
      adj[i].clear();
      dist[i] = 0;
    }
    for (int i = 0; i < n - 1; i++) {
      cin >> u >> v;
      u--;
      v--;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    if (db <= 2 * da) {
      cout << "Alice\n";
      continue;
    }
    dfs(a, -1, 0);
    if (dist[b] <= da) {
      cout << "Alice\n";
      continue;
    }
    for (int i = 0; i < n; i++) {
      dist[i] = 0;
    }
    len = 0;
    dfs2(0, -1);
    len--;
    if (len >= 2 * da + 1) {
      cout << "Bob\n";
    } else {
      cout << "Alice\n";
    }
  }
  return 0;
}
