#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;
const int bit = 32;
const double pi = acos(-1.0);
vector<int> v[M];
int d[M], n, ma, st, flag;
int da, db, s, t, vis[M];
queue<int> q;
int bfs(int u) {
  for (int i = 1; i <= n; i++) d[i] = vis[i] = 0;
  while (q.size()) q.pop();
  q.push(u);
  vis[u] = 1;
  int y;
  while (q.size()) {
    y = q.front();
    q.pop();
    for (int i = 0; i < v[y].size(); i++) {
      int p = v[y][i];
      if (vis[p]) {
        continue;
      }
      d[p] = d[y] + 1;
      vis[p] = 1;
      q.push(p);
    }
  }
  return y;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d%d%d%d", &n, &s, &t, &da, &db);
    flag = 0;
    ma = 0;
    for (int i = 1; i <= n; i++) {
      d[i] = 0;
      v[i].clear();
    }
    for (int i = 1; i < n; i++) {
      int x, y;
      scanf("%d%d", &x, &y);
      v[x].push_back(y);
      v[y].push_back(x);
    }
    st = bfs(s);
    if (d[t] <= da) {
      puts("Alice");
      continue;
    }
    st = bfs(st);
    db = min(db, d[st]);
    printf("%s\n", da * 2 >= db ? "Alice" : "Bob");
  }
  return 0;
}
