#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> g[N], dis(N, 0);
int dia = 0;
int dfs(int node, int p) {
  int mx = 0;
  for (auto u : g[node]) {
    if (u != p) {
      dis[u] = dis[node] + 1;
      int curpath = dfs(u, node) + 1;
      dia = max(dia, mx + curpath);
      mx = max(mx, curpath);
    }
  }
  return mx;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    for (int i = 1; i <= n; i++) g[i].clear(), dis[i] = 0;
    dia = 0;
    for (int i = 1; i < n; i++) {
      int u, v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    dfs(a, 0);
    if (dis[b] > da && 2 * da < dia && db > 2 * da)
      cout << "Bob" << endl;
    else
      cout << "Alice" << endl;
  }
  return 0;
}
