#include <bits/stdc++.h>
using namespace std;
int n, a, b, da, db;
vector<vector<int> > T;
vector<int> h;
int diam = 0;
void dfs(int x, int par, int he) {
  h[x] = he;
  for (int v : T[x]) {
    if (v != par) {
      dfs(v, x, he + 1);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n >> a >> b >> da >> db;
    --a;
    --b;
    T = vector<vector<int> >(n);
    h = vector<int>(n, -1);
    for (int i = 0; i < n - 1; ++i) {
      int u, v;
      cin >> u >> v;
      --u;
      --v;
      T[u].push_back(v);
      T[v].push_back(u);
    }
    if (db < 2 * da + 1)
      cout << "Alice" << endl;
    else {
      dfs(a, -1, 0);
      if (h[b] <= da)
        cout << "Alice" << endl;
      else {
        int far = a;
        for (int i = 0; i < n; ++i) {
          if (h[far] < h[i]) far = i;
        }
        dfs(far, -1, 0);
        int diam = 0;
        for (int i = 0; i < n; ++i) diam = max(diam, h[i]);
        if (diam >= 2 * da + 1)
          cout << "Bob" << endl;
        else
          cout << "Alice" << endl;
      }
    }
  }
}
