#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 8;
int dis[N];
bool vis[N];
vector<int> G[N];
void init(int n) {
  for (int i = 1; i <= n; i++) {
    G[i].clear();
    vis[i] = 0;
    dis[i] = 0;
  }
}
void dfs(int u) {
  vis[u] = 1;
  for (int i = 0; i < G[u].size(); ++i) {
    int v = G[u][i];
    if (vis[v]) continue;
    dis[v] = dis[u] + 1;
    dfs(v);
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    init(n);
    int u, v;
    for (int i = 1; i < n; i++) {
      cin >> u >> v;
      G[u].push_back(v);
      G[v].push_back(u);
    }
    dfs(a);
    int dab = dis[b];
    int id, maxn = 0;
    for (int i = 1; i <= n; i++) {
      if (dis[i] > maxn) {
        id = i;
        maxn = dis[i];
      }
    }
    for (int i = 1; i <= n; i++) {
      dis[i] = 0;
      vis[i] = 0;
    }
    dfs(id);
    int l = 0;
    for (int i = 1; i <= n; i++) {
      l = max(l, dis[i]);
    }
    if (dab <= da || da * 2 >= db || l <= da * 2) {
      cout << "Alice\n";
    } else
      cout << "Bob\n";
  }
  return 0;
}
