#include <bits/stdc++.h>
using namespace std;
vector<int> edge[100010];
bool vis[100010];
int dist[100010];
void dfs(int u, int d = 0) {
  vis[u] = true;
  dist[u] = d;
  for (int v : edge[u]) {
    if (!vis[v]) {
      dfs(v, d + 1);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    int m, d, l;
    for (int i = 1; i <= n; i++) {
      edge[i].clear();
      vis[i] = false;
    }
    int u, v;
    for (int i = 1; i < n; i++) {
      cin >> u >> v;
      edge[u].push_back(v);
      edge[v].push_back(u);
    }
    dfs(a, 0);
    d = dist[b];
    m = b;
    for (int i = 1; i <= n; i++) {
      if (dist[i] > dist[m]) {
        m = i;
      }
      vis[i] = false;
    }
    dfs(m, 0);
    for (int i = 1; i <= n; i++) {
      if (dist[i] > dist[m]) {
        m = i;
      }
    }
    l = dist[m];
    if (d > da and min(db, l) > 2 * da) {
      cout << "Bob" << endl;
    } else {
      cout << "Alice" << endl;
    }
  }
  return 0;
}
