#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
const int MAX_N = 100005;
int n, a, b, da, db;
vector<int> adj[MAX_N];
int depth[MAX_N];
void clear_globals() {
  for (int i = 0; i < n; i++) adj[i].clear();
}
void dfs(int u, int p, int d) {
  depth[u] = d;
  for (int v : adj[u])
    if (v != p) {
      dfs(v, u, d + 1);
    }
}
pair<int, int> getfarthest(int u, int p) {
  pair<int, int> res = make_pair(0, u);
  for (int v : adj[u])
    if (v != p) {
      pair<int, int> tmp = getfarthest(v, u);
      ckmax(res, make_pair(tmp.first + 1, tmp.second));
    }
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    a--;
    b--;
    clear_globals();
    for (int i = 0; i < n - 1; i++) {
      int u, v;
      cin >> u >> v;
      u--;
      v--;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    if (2 * da >= db) {
      cout << "Alice\n";
      continue;
    }
    dfs(a, -1, 0);
    if (depth[b] <= da) {
      cout << "Alice\n";
      continue;
    }
    pair<int, int> tmp = getfarthest(0, -1);
    tmp = getfarthest(tmp.second, -1);
    int dis = tmp.first;
    int half = dis / 2;
    if (dis % 2) half++;
    if (half <= da) {
      cout << "Alice\n";
    } else {
      cout << "Bob\n";
    }
  }
}
