#include <bits/stdc++.h>
char _;
using namespace std;
void PRINT(int x, int y) {
  for (int i = y - 1; i >= 0; i--) {
    cout << ((0u == (x & (1 << i))) ? 0u : 1u);
  }
  cout << endl;
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) int idx,
               __attribute__((unused)) int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
vector<vector<int> > g(100015);
int n, a, b, da, db, f = -1, d = -1;
int dist[110005] = {0};
int dist2[110005] = {0};
void dfs1(int pos, int par, int cDist) {
  dist[pos] = cDist;
  for (int x = 0; x < g[pos].size(); x++) {
    if (g[pos][x] == par) continue;
    dfs1(g[pos][x], pos, cDist + 1);
  }
}
void dfs4(int pos, int par, int cDist) {
  dist2[pos] = cDist;
  for (int x = 0; x < g[pos].size(); x++) {
    if (g[pos][x] == par) continue;
    dfs1(g[pos][x], pos, cDist + 1);
  }
}
void dfs2(int pos, int par) {
  if (ceil((double)dist[pos] / (double)da) <=
      ceil((double)dist2[pos] / (double)db)) {
    return;
  }
  if (dist[pos] > d) {
    d = dist[pos];
    f = pos;
  }
  for (int x = 0; x < g[pos].size(); x++) {
    if (g[pos][x] == par) continue;
    dfs2(g[pos][x], pos);
  }
}
void dfs3(int pos, int par, int cDist) {
  if (cDist > f) {
    f = cDist;
  }
  for (int x = 0; x < g[pos].size(); x++) {
    if (g[pos][x] == par) continue;
    dfs3(g[pos][x], pos, cDist + 1);
  }
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    for (int x = 0; x < n + 5; x++) {
      g[x].clear();
      dist2[x] = dist[x] = 0;
    }
    f = d = -1;
    for (int x = 0; x < n - 1; x++) {
      int a, b;
      cin >> a >> b;
      g[a].push_back(b);
      g[b].push_back(a);
    }
    if (db < 2 * da + 1) {
      cout << "Alice\n";
    } else {
      dfs4(b, -1, 0);
      dfs1(a, -1, 0);
      if (dist[b] <= da) {
        cout << "Alice\n";
      } else {
        dfs2(b, -1);
        int start = f;
        f = -1;
        dfs3(start, -1, 0);
        if (f >= 2 * da + 1) {
          cout << "Bob\n";
        } else {
          cout << "Alice\n";
        }
      }
    }
  }
  return 0;
}
