#include <bits/stdc++.h>
using namespace std;
const int N = 3e5;
int n, a, b, da, db, h[N], ab, root, diam;
vector<int> g[N];
void dfs(int v, int p) {
  h[v] = (p == -1) ? 0 : h[p] + 1;
  if (v == b && ab == -1) {
    ab = h[v];
  }
  if (h[v] > diam) {
    diam = h[v];
    root = v;
  }
  for (int u : g[v]) {
    if (u != p) {
      dfs(u, v);
    }
  }
}
void solve() {
  cin >> n >> a >> b >> da >> db;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  ab = -1;
  root = -1;
  diam = 0;
  dfs(a, -1);
  dfs(root, -1);
  if (db <= 2 * da || diam <= 2 * da || ab <= da) {
    puts("Alice");
  } else {
    puts("Bob");
  }
  for (int i = 0; i < n + 1; ++i) {
    g[i].clear();
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
}
