#include <bits/stdc++.h>
using namespace std;
long long int len = 0;
long long int node = 0;
long long int dist[100005];
void dfs(long long int i, long long int par, long long int d,
         vector<long long int> v[]) {
  dist[i] = d;
  long long int k = v[i].size();
  if (d > len) {
    len = d;
    node = i;
  }
  for (long long int j = 0; j < k; j++) {
    if (v[i][j] == par) continue;
    dfs(v[i][j], i, d + 1, v);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    vector<long long int> v[n + 1];
    for (long long int i = 0; i < n - 1; i++) {
      long long int x, y;
      cin >> x >> y;
      v[x].push_back(y);
      v[y].push_back(x);
    }
    long long int check = 0;
    if (db >= (2 * da + 1)) {
      dfs(1, 0, 0, v);
      len = 0;
      dfs(node, 0, 0, v);
      if (len >= (2 * da + 1)) check = 1;
      dfs(a, 0, 0, v);
      if (dist[b] <= da) check = 0;
      len = 0;
    }
    if (check == 1)
      cout << "Bob\n";
    else
      cout << "Alice\n";
  }
  return 0;
}
