#include <bits/stdc++.h>
using namespace std;
vector<int> edges[100005];
int dis[100005];
void get_dis(int p, int x, int c) {
  dis[x] = c;
  for (int nxt : edges[x]) {
    if (p != nxt) {
      get_dis(x, nxt, c + 1);
    }
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, a, b, da, db;
    cin >> n >> a >> b >> da >> db;
    for (int i = 1; i <= n; i++) {
      edges[i] = {};
    }
    for (int i = 1; i < n; i++) {
      int u, v;
      cin >> u >> v;
      edges[u].push_back(v);
      edges[v].push_back(u);
    }
    get_dis(0, a, 0);
    int fir = dis[b];
    int e = max_element(dis + 1, dis + n + 1) - dis;
    int _m = *max_element(dis + 1, dis + n + 1);
    get_dis(0, e, 0);
    int dia = *max_element(dis + 1, dis + n + 1);
    if (dia > 2 * da && db > 2 * da && fir > da) {
      cout << "Bob" << endl;
    } else {
      cout << "Alice" << endl;
    }
  }
}
