#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long N = 1e5 + 1;
long long n, x, l;
vector<bool> visited(N);
vector<long long> adj[N];
long long timer, dis[N], ans = 0;
vector<long long> tin, tout;
vector<vector<long long>> up;
void dfs(long long v, long long p) {
  tin[v] = ++timer;
  up[v][0] = p;
  for (long long i = 1; i <= l; i++) up[v][i] = up[up[v][i - 1]][i - 1];
  for (auto u : adj[v]) {
    if (u != p) {
      dis[u] = dis[v] + 1;
      dfs(u, v);
    }
  }
  tout[v] = ++timer;
}
bool check(long long u, long long v) {
  return tin[u] <= tin[v] && tout[u] >= tout[v];
}
long long lca(long long u, long long v) {
  if (check(u, v)) return u;
  if (check(v, u)) return v;
  for (long long i = l; i >= 0; i--)
    if (!check(up[u][i], v)) u = up[u][i];
  return up[u][0];
}
void preprocess(long long root) {
  tin.resize(n + 1);
  tout.resize(n + 1);
  timer = 0;
  l = ceil(log2(n + 1));
  up.assign(n + 1, vector<long long>(l + 1));
  dfs(root, root);
}
void dfsUtil(long long node, long long count, long long& maxCount) {
  visited[node] = true;
  count++;
  for (auto i : adj[node]) {
    if (!visited[i]) {
      if (count >= maxCount) {
        maxCount = count;
        x = i;
      }
      dfsUtil(i, count, maxCount);
    }
  }
}
void dfs1(long long node, long long& maxCount) {
  long long count = 0;
  for (long long i = 1; i <= n; ++i) visited[i] = false;
  dfsUtil(node, count, maxCount);
}
long long diameter() {
  long long maxCount = INT_MIN;
  dfs1(1, maxCount);
  dfs1(x, maxCount);
  return maxCount;
}
void test_case() {
  long long a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  for (long long i = 0; i <= n; i++) {
    adj[i].clear();
  }
  for (long long i = 0; i < n - 1; i++) {
    long long xx, yy;
    cin >> xx >> yy;
    adj[xx].push_back(yy);
    adj[yy].push_back(xx);
  }
  preprocess(1);
  long long dx = dis[a], dy = dis[b];
  long long lc = lca(a, b);
  long long dlc = dis[lc];
  long long tot = dx + dy - 2 * dlc;
  long long dia = diameter();
  if (tot <= da or dia <= da * 2 or (db <= 2 * da)) {
    cout << "Alice\n";
    return;
  }
  cout << "Bob\n";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  cin >> tc;
  while (tc--) test_case();
  return 0;
}
