#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5;
vector<long long int> graph[N];
long long int n, a, b, da, db;
long long int maxDist;
long long int node;
void pre() {
  for (long long int i = 0; i <= n; i++) {
    graph[i].clear();
  }
}
long long int getDist(long long int src, long long int dest,
                      vector<long long int>& dist) {
  long long int ret = -1;
  dist[src] = 0;
  queue<long long int> q;
  q.push(src);
  while (!q.empty()) {
    long long int x = q.front();
    q.pop();
    if (x == dest) {
      ret = dist[x];
    }
    for (auto& it : graph[x]) {
      if (dist[it] != -1) continue;
      dist[it] = dist[x] + 1;
      q.push(it);
    }
  }
  return ret;
}
void zanj0() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void solve() {
  maxDist = 0;
  node = 1;
  cin >> n >> a >> b >> da >> db;
  pre();
  vector<long long int> dist(n + 1, -1);
  for (long long int i = 0, u, v; i < n - 1; i++) {
    cin >> u >> v;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  long long int D = getDist(a, b, dist);
  maxDist = INT_MIN;
  node = -1;
  for (long long int i = 1; i <= n; i++) {
    if (maxDist < dist[i]) {
      maxDist = dist[i];
      node = i;
    }
  }
  for (long long int i = 0; i < dist.size(); i++) {
    dist[i] = -1;
  }
  getDist(node, a, dist);
  for (long long int i = 0; i < dist.size(); i++) {
    maxDist = max(maxDist, dist[i]);
  }
  if (da >= D) {
    cout << "Alice" << endl;
    return;
  }
  db = min(db, maxDist);
  if (db > 2 * da) {
    cout << "Bob" << endl;
  } else {
    cout << "Alice" << endl;
  }
}
int main() {
  zanj0();
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
