#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
vector<long long int> adj[100005];
long long int maxlen;
bool fii(long long int n, long long int b, long long int dist,
         long long int par) {
  if (dist < 0) return 0;
  if (n == b) return 1;
  bool res = 0;
  for (auto i : adj[n]) {
    if (i != par) {
      if (fii(i, b, dist - 1, n)) res = 1;
    }
  }
  return res;
}
void dfs(long long int n, long long int par, long long int &node,
         long long int cnt) {
  cnt++;
  if (cnt >= maxlen) {
    maxlen = cnt;
    node = n;
  }
  for (auto i : adj[n]) {
    if (i != par) {
      dfs(i, n, node, cnt);
    }
  }
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    for (int i = 1; i <= n; i++) adj[i].clear();
    for (int i = 0; i < n - 1; i++) {
      long long int x, y;
      cin >> x >> y;
      adj[x].push_back(y);
      adj[y].push_back(x);
    }
    if (fii(a, b, da, -1)) {
      cout << "Alice\n";
      continue;
    }
    if (db < 2 * da + 1) {
      cout << "Alice\n";
      continue;
    }
    maxlen = 0;
    long long int node = 1, nnn = 1;
    dfs(1, -1, node, 0);
    dfs(node, -1, nnn, 0);
    if (maxlen <= 2 * da + 1)
      cout << "Alice\n";
    else
      cout << "Bob\n";
  }
}
