#include <bits/stdc++.h>
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<long long, long long>;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                  'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                  's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
template <typename T>
struct Edge {
  int to;
  T cost;
};
using Graph = vector<vector<Pll>>;
Pll dfs(Graph &G, int u, int par) {
  Pll ret = make_pair(0ll, u);
  for (auto e : G[u]) {
    if (e.first == par) continue;
    auto next = dfs(G, e.first, u);
    next.first += e.second;
    ret = max(ret, next);
  }
  return ret;
}
long long tree_diamiter(Graph &G) {
  Pll p = dfs(G, 0, -1);
  Pll q = dfs(G, p.second, -1);
  return q.first;
}
void solve() {
  long long n, a, b, da, db;
  cin >> n >> a >> b >> da >> db;
  a--;
  b--;
  Graph G(n);
  for (int i = (0), i_len = (n - 1); i < i_len; ++i) {
    long long u, v;
    cin >> u >> v;
    u--;
    v--;
    G[u].push_back(Pll(v, 1ll));
    G[v].push_back(Pll(u, 1ll));
  }
  long long ret = tree_diamiter(G);
  vector<int> flag(n, -1);
  flag[a] = 0;
  stack<int> st;
  st.push(a);
  while (!st.empty()) {
    int now = st.top();
    st.pop();
    for (int i = (0), i_len = (G[now].size()); i < i_len; ++i) {
      int next = G[now][i].first;
      if (flag[next] == -1) {
        flag[next] = flag[now] + 1;
        st.push(next);
      }
    }
  }
  if (flag[b] <= da) {
    cout << "Alice" << endl;
    return;
  }
  if (min(ret, db) <= 2 * da) {
    cout << "Alice" << endl;
    return;
  }
  cout << "Bob" << endl;
  return;
}
int main() {
  int t;
  cin >> t;
  for (int i = (0), i_len = (t); i < i_len; ++i) {
    solve();
  }
}
