#include <bits/stdc++.h>
using namespace std;
long long n, a, b, da, db;
vector<long long> v[100005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    for (long long i = 0; i < n + 2; i++) v[i].clear();
    for (long long i = 0; i < n - 1; i++) {
      long long x, y;
      cin >> x >> y;
      v[x].push_back(y);
      v[y].push_back(x);
    }
    long long vis[n + 1];
    memset(vis, 0, sizeof(vis));
    vis[a] = 1;
    queue<long long> q;
    q.push(a);
    long long dis[n + 1];
    dis[a] = 0;
    while (!q.empty()) {
      long long u = q.front();
      q.pop();
      for (auto it : v[u]) {
        if (!vis[it]) {
          dis[it] = dis[u] + 1;
          vis[it] = 1;
          q.push(it);
        }
      }
    }
    if (db <= 2 * da || dis[b] <= da) {
      cout << "Alice\n";
      continue;
    }
    dis[b] = 0;
    memset(vis, 0, sizeof(vis));
    vis[b] = 1;
    q.push(b);
    while (!q.empty()) {
      long long u = q.front();
      q.pop();
      for (auto it : v[u]) {
        if (!vis[it]) {
          dis[it] = dis[u] + 1;
          vis[it] = 1;
          q.push(it);
        }
      }
    }
    long long node, maxi = 0;
    for (long long i = 1; i <= n; i++) {
      if (dis[i] > maxi) {
        maxi = dis[i];
        node = i;
      }
    }
    dis[node] = 0;
    memset(vis, 0, sizeof(vis));
    vis[node] = 1;
    q.push(node);
    while (!q.empty()) {
      long long u = q.front();
      q.pop();
      for (auto it : v[u]) {
        if (!vis[it]) {
          dis[it] = dis[u] + 1;
          vis[it] = 1;
          q.push(it);
        }
      }
    }
    maxi = 0;
    for (long long i = 1; i <= n; i++) {
      if (dis[i] > maxi) {
        maxi = dis[i];
      }
    }
    if (maxi > 2 * da) {
      cout << "Bob\n";
    } else
      cout << "Alice\n";
  }
}
