#include <bits/stdc++.h>
using namespace std;
long long mod(long long a) {
  long long c = a % (long long)(1E9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1E9 + 7);
}
long long inf = (long long)1E16;
long long max(long long a, long long b) {
  if (a < b)
    return b;
  else
    return a;
}
long long min(long long a, long long b) {
  if (a > b)
    return b;
  else
    return a;
}
void Max(long long &pos, long long val) { pos = max(pos, val); }
void Min(long long &pos, long long val) { pos = min(pos, val); }
void Add(long long &pos, long long val) { pos = mod(pos + val); }
long double EPS = 1E-12;
template <class T, class S>
inline bool chmax(T &a, S b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T, class S>
inline bool chmin(T &a, S b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
void mod_print(long long k) {
  long long P = 50000;
  for (long long y = 1; y <= P; y++) {
    long long x = mod(y * k);
    if (abs(x) <= P || x + P >= (long long)(1E9 + 7)) {
      if (x + P >= (long long)(1E9 + 7)) {
        x -= (long long)(1E9 + 7);
      }
      cout << x << "/" << y << "\n";
      return;
    }
  }
  cout << "nun"
       << "\n";
}
void ali() {
  cout << "Alice"
       << "\n";
}
void bob() {
  cout << "Bob"
       << "\n";
}
long long d[100005];
void cal(long long s, long long n, vector<long long> v[]) {
  for (long long i = 1; i <= n; i++) d[i] = inf;
  queue<long long> q;
  q.push(s);
  d[s] = 0;
  while (!q.empty()) {
    long long t = q.front();
    q.pop();
    for (auto x : v[t]) {
      if (d[x] == inf) {
        d[x] = d[t] + 1;
        q.push(x);
      }
    }
  }
}
bool anspro() {
  long long n, a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  vector<long long> v[n + 1];
  for (long long i = 1; i <= n - 1; i++) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  if (da * 2 >= db) {
    ali();
    return 0;
  }
  cal(a, n, v);
  if (d[b] <= da) {
    ali();
    return 0;
  }
  long long mx = 1;
  for (long long i = 1; i <= n; i++) {
    if (d[i] > d[mx]) mx = i;
  }
  cal(mx, n, v);
  mx = 1;
  for (long long i = 1; i <= n; i++) {
    if (d[i] > d[mx]) mx = i;
  }
  if (d[mx] > da * 2) {
    bob();
    return 0;
  } else {
    ali();
    return 0;
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long que;
  cin >> que;
  while (que--) {
    anspro();
  }
  return 0;
}
