#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
vector<int> adj[maxn];
int dep[maxn];
int d, n, a, b, da, db;
int dfs(int u, int pre) {
  int maxpath = 0;
  for (int v : adj[u]) {
    if (v == pre) continue;
    dep[v] = dep[u] + 1;
    int nowpath = 1 + dfs(v, u);
    d = max(d, nowpath + maxpath);
    maxpath = max(maxpath, nowpath);
  }
  return maxpath;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    for (int i = 1; i <= n; i++) adj[i].clear();
    for (int i = 0; i < n - 1; i++) {
      int u, v;
      cin >> u >> v;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    d = 0;
    dep[a] = 0;
    dfs(a, -1);
    if (2 * da >= min(d, db) || dep[b] <= da)
      cout << "Alice" << endl;
    else
      cout << "Bob" << endl;
  }
  return 0;
}
