#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6;
int N, T, A, B, DA, DB;
vector<int> adj[MAXN];
pair<int, int> farthest(int i, int p, int d) {
  pair<int, int> ret(d, i);
  for (int j : adj[i]) {
    if (j == p) {
      continue;
    }
    ret = max(ret, farthest(j, i, d + 1));
  }
  return ret;
}
int dis(int i, int j, int p, int d) {
  if (i == j) {
    return d;
  }
  for (int k : adj[i]) {
    if (k == p) {
      continue;
    }
    int x = dis(k, j, i, d + 1);
    if (x != -1) {
      return x;
    }
  }
  return -1;
}
void solve() {
  scanf("%d%d%d%d%d", &N, &A, &B, &DA, &DB);
  for (int i = 1; i <= N; i++) {
    adj[i].clear();
  }
  for (int i = 0, x, y; i < N - 1; i++) {
    scanf("%d%d", &x, &y);
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  if (DB <= 2 * DA || dis(A, B, 0, 0) <= DA) {
    puts("Alice");
    return;
  }
  int diam = farthest(farthest(1, 0, 0).second, 0, 0).first;
  puts(2 * DA >= diam ? "Alice" : "Bob");
}
int main() {
  scanf("%d", &T);
  for (int test = 0; test < T; test++) {
    solve();
  }
}
