#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 10;
const int inf = 1e9;
vector<vector<int>> g;
vector<int> used;
vector<int> gl;
vector<int> d;
int GM = 0;
void dfs(int v) {
  used[v] = 1;
  int dm = 0;
  int dm2 = 0;
  for (auto to : g[v]) {
    if (!used[to]) {
      d[to] = d[v] + 1;
      dfs(to);
      if (gl[to] >= dm) {
        dm2 = dm;
        dm = gl[to];
      } else if (gl[to] >= dm2) {
        dm2 = gl[to];
      }
    }
  }
  gl[v] = dm + 1;
  GM = max(GM, dm + dm2 + 1);
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    a--;
    b--;
    g.clear();
    used.clear();
    g.resize(n);
    used.resize(n);
    gl.clear();
    gl.resize(n);
    d.clear();
    d.resize(n);
    GM = 0;
    for (int i = 0; i < n - 1; i++) {
      int v, u;
      cin >> v >> u;
      v--;
      u--;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    if (da > db) {
      cout << "Alice" << endl;
      continue;
    }
    if (db <= 2 * da) {
      cout << "Alice" << endl;
      continue;
    }
    dfs(a);
    if (d[b] <= da) {
      cout << "Alice" << endl;
      continue;
    }
    if (GM <= 2 * da + 1) {
      cout << "Alice" << endl;
      continue;
    }
    cout << "Bob" << endl;
  }
}
