#include <bits/stdc++.h>
using namespace std;
int q;
long long int n;
int ans, sum;
long long int powe(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a);
    }
    a = (a * a);
    b /= 2;
  }
  return res;
}
void the_happiest_place_on_earth() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
}
const int N = 100005;
int dis[N];
vector<int> graph[N];
int dfs(int node, int pa) {
  dis[node] = dis[pa] + 1;
  ans = max(ans, dis[node]);
  int mx = 0, gg;
  for (auto x : graph[node])
    if (x != pa) {
      gg = dfs(x, node) + 1;
      ans = max(ans, mx + gg);
      mx = max(mx, gg);
    }
  return mx;
}
void testcase() {
  int a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  for (int i = 1; i <= n; i++) graph[i].clear();
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
  ans = 0;
  dfs(a, 0);
  (2 * da >= min(ans, db) || dis[b] <= da) ? (cout << "Alice\n")
                                           : (cout << "Bob\n");
  return;
}
int main() {
  the_happiest_place_on_earth();
  q = 1;
  dis[0] = -1;
  cin >> q;
  while (q--) {
    testcase();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
