#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int inf = 0x3f3f3f3f;
const long long linf = 1234567890123456789;
const long long mod = 1000000007;
vector<vector<int> > adj;
vector<int> dist;
void distsfrom(int u, int prev, int d) {
  dist[u] = d;
  for (int x : adj[u]) {
    if (x != prev) distsfrom(x, u, 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;
    a--, b--;
    adj = vector<vector<int> >(n);
    for (int i = 0; i < n - 1; i++) {
      int u, v;
      cin >> u >> v;
      u--, v--;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
    if (da * 2 >= db) {
      cout << "Alice\n";
      continue;
    }
    dist = vector<int>(n);
    distsfrom(0, -1, 0);
    int f = -1, fa = -1;
    for (int i = 0; i < n; i++) {
      if (dist[i] > f) {
        f = dist[i];
        fa = i;
      }
    }
    distsfrom(fa, -1, 0);
    int dia = 0;
    for (int i = 0; i < n; i++) {
      dia = max(dia, dist[i]);
    }
    if (dia <= 2 * da) {
      cout << "Alice\n";
      continue;
    }
    distsfrom(a, -1, 0);
    if (dist[b] <= da) {
      cout << "Alice\n";
      continue;
    }
    cout << "Bob\n";
  }
}
