#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
struct EDGE {
  int next, to;
} edge[maxn * 2];
int head[maxn], cnt;
void addEdge(int u, int v) {
  edge[++cnt].next = head[u];
  edge[cnt].to = v;
  head[u] = cnt;
}
int x;
int maxx = -1;
int d;
int n, a, b;
void dfs(int now, int fa, int len) {
  if (len >= maxx) {
    maxx = len;
    x = now;
  }
  if (now == b) {
    d = len;
  }
  for (int i = head[now]; i; i = edge[i].next) {
    int to = edge[i].to;
    if (to == fa) continue;
    dfs(to, now, len + 1);
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    maxx = -1;
    cnt = 0;
    int da, db;
    int u, v;
    cin >> n >> a >> b >> da >> db;
    for (int i = 1; i <= n; ++i) head[i] = 0;
    for (int i = 1; i <= n - 1; ++i) {
      cin >> u >> v;
      addEdge(u, v);
      addEdge(v, u);
    }
    dfs(a, -1, 0);
    int dd = d;
    dfs(x, -1, 0);
    int flag = 1;
    if (da * 2 < min(maxx, db) && dd > da) flag = 0;
    if (flag)
      cout << "Alice\n";
    else
      cout << "Bob\n";
  }
  return 0;
}
