#include <bits/stdc++.h>
using namespace std;
void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int64_t t;
  cin >> t;
  while (t--) solve();
  return 0;
}
int64_t n, a, b, da, db, diam;
vector<vector<int64_t> > to;
int64_t depth[100001];
int64_t dfs(int64_t n, int64_t p) {
  int64_t len = 0;
  for (int64_t &i : to[n])
    if (i != p) {
      depth[i] = depth[n] + 1;
      int64_t cur = 1 + dfs(i, n);
      diam = (diam > cur + len ? diam : cur + len);
      len = (len > cur ? len : cur);
    }
  return len;
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  to = vector<vector<int64_t> >(n + 1);
  for (int64_t i = 0; i < n - 1; i++) {
    int64_t ina, inb;
    cin >> ina >> inb;
    to[ina].push_back(inb);
    to[inb].push_back(ina);
  }
  if (db <= 2 * da) {
    cout << "Alice\n";
    return;
  }
  diam = 0;
  depth[a] = 0;
  dfs(a, -1);
  if (diam <= 2 * da || depth[b] <= da) {
    cout << "Alice\n";
    return;
  }
  {
    cout << "Bob\n";
    return;
  }
}
