#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int n, a, b, da, db, dist;
vector<int> adj[MAXN];
bool visited[MAXN];
int dis[MAXN];
int bfs(int u) {
  queue<int> q;
  q.push(u);
  memset(dis, -1, sizeof(dis));
  dis[u] = 0;
  while (!q.empty()) {
    u = q.front();
    q.pop();
    for (auto v : adj[u]) {
      if (dis[v] == -1) {
        dis[v] = dis[u] + 1;
        q.push(v);
      }
    }
  }
  return u;
}
int calcTreeDiameter(int root = a) {
  int u = bfs(root);
  int v = bfs(u);
  return dis[v];
}
void dfs(int node = a, int par = -1, int d = 0) {
  if (visited[node] || dist) return;
  visited[node] = 1;
  if (node == b) dist = d;
  for (auto i : adj[node])
    if (i != par) dfs(i, node, d + 1);
}
int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  cin >> t;
  while (t--) {
    dist = 0;
    cin >> n >> a >> b >> da >> db;
    for (int i = 0; i <= n; i++) adj[i].clear(), visited[i] = 0;
    for (int i = 0, fr, to; i < n - 1; i++) {
      cin >> fr >> to;
      adj[fr].push_back(to);
      adj[to].push_back(fr);
    }
    dfs();
    int dia = calcTreeDiameter();
    if (dist <= da || da * 2 >= min(db, dia))
      cout << "Alice\n";
    else
      cout << "Bob\n";
  }
  return 0;
}
