#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using db = double;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
const int inf = 0x3f3f3f3f;
const int rinf = 0xc0c0c0c0;
const LL MOD = 1e9 + 7;
const LL LMAX = 0x7fffffffffffffff;
const LL LMIN = 0x8000000000000000;
using std::cin;
using std::cout;
using std::endl;
using std::vector;
template <typename T>
void print(vector<vector<T>> a) {
  for (int i = 0; i < a.size(); ++i) {
    for (int j = 0; j < a[i].size(); ++j)
      cout << a[i][j] << (j == ((int)a[i].size()) - 1 ? '\n' : ' ');
  }
}
template <typename T>
void print(T *a, int len) {
  for (int i = 0; i < len; ++i) cout << a[i] << " ";
  cout << endl;
}
template <typename T>
void print(T **a, int row, int col) {
  for (int i = 0; i < row; ++i) {
    for (int j = 0; j < col; ++j)
      cout << a[i][j] << (j == col - 1 ? '\n' : ' ');
  }
}
template <typename T1, typename T2>
void print(const vector<pair<T1, T2>> a) {
  for (auto &e : a) cout << "(" << e.first << ", " << e.second << ")\n";
}
template <typename... Args>
void _SHOW_ALL(Args... args) {}
template <typename T, typename... Args>
void _SHOW_ALL(T val, Args... args) {
  cout << val << ", ";
  _SHOW_ALL(args...);
}
template <typename T, typename... Args>
void to_brackets(T val, Args... args) {
  cout << "(";
  _SHOW_ALL(val, args...);
  cout << ")\n";
}
template <typename... Args>
void wprint(Args... args) {
  cout << '\n';
}
template <typename T, typename... Args>
void wprint(T val, Args... args) {
  cout << val << " ";
  wprint(args...);
}
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
  return f * x;
}
void write(int a) {
  if (a < 0) putchar('-'), a = -a;
  if (a >= 10) write(a / 10);
  putchar(a % 10 + 48);
}
const int maxn = 1e5 + 50;
VI E[maxn];
VI Dep[maxn];
bool flag;
int vis[maxn], mxd;
void dfs(int cur, int dep, int ma, int fa = -1) {
  if (dep <= ma) vis[cur] = 1;
  Dep[dep].push_back(cur);
  mxd = max(mxd, dep);
  for (auto &go : E[cur]) {
    if (go == fa) continue;
    dfs(go, dep + 1, ma, cur);
  }
}
void findmx(int cur, int dep, int fa = -1) {
  mxd = max(mxd, dep);
  for (auto &go : E[cur]) {
    if (go == fa) continue;
    findmx(go, dep + 1, cur);
  }
}
void solve() {
  int n = read(), a = read(), b = read(), da = read(), db = read();
  for (int i = 0; i <= n; ++i) E[i].clear(), vis[i] = 0, Dep[i].clear();
  for (int i = 0; i < n - 1; ++i) {
    int u = read(), v = read();
    E[u].push_back(v);
    E[v].push_back(u);
  }
  mxd = -1;
  dfs(a, 0, da);
  findmx(Dep[mxd].back(), 0);
  if (!vis[b] && db >= 2 * da + 1 && mxd >= 2 * da + 1)
    cout << "Bob\n";
  else
    cout << "Alice\n";
}
int main() {
  int t = read();
  while (t--) solve();
  return 0;
}
