Alice and Bob are playing a fun game of tree tag.

The game is played on a tree of n vertices numbered from 1 to n. Recall that a tree on n vertices is an undirected, connected graph with n-1 edges.

Initially, Alice is located at vertex a, and Bob at vertex b. They take turns alternately, and Alice makes the first move. In a move, Alice can jump to a vertex with distance at most da from the current vertex. And in a move, Bob can jump to a vertex with distance at most db from the current vertex. The distance between two vertices is defined as the number of edges on the unique simple path between them. In particular, either player is allowed to stay at the same vertex in a move. Note that when performing a move, a player only occupies the starting and ending vertices of their move, not the vertices between them.

If after at most 10^{100} moves, Alice and Bob occupy the same vertex, then Alice is declared the winner. Otherwise, Bob wins.

Determine the winner if both players play optimally.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^4). Description of the test cases follows.

The first line of each test case contains five integers n,a,b,da,db (2≤ n≤ 10^5, 1≤ a,b≤ n, a≠ b, 1≤ da,db≤ n-1) — the number of vertices, Alice's vertex, Bob's vertex, Alice's maximum jumping distance, and Bob's maximum jumping distance, respectively.

The following n-1 lines describe the edges of the tree. The i-th of these lines contains two integers u, v (1≤ u, v≤ n, u≠ v), denoting an edge between vertices u and v. It is guaranteed that these edges form a tree structure.

It is guaranteed that the sum of n across all test cases does not exceed 10^5.

Output

For each test case, output a single line containing the winner of the game: "Alice" or "Bob".

Example

Input


4
4 3 2 1 2
1 2
1 3
1 4
6 6 1 2 5
1 2
6 5
2 3
3 4
4 5
9 3 9 2 5
1 2
1 6
1 9
1 3
9 5
7 9
4 8
4 3
11 8 11 3 3
1 2
11 9
4 9
6 5
2 10
3 2
5 9
8 3
7 4
7 10


Output


Alice
Bob
Alice
Alice

Note

In the first test case, Alice can win by moving to vertex 1. Then wherever Bob moves next, Alice will be able to move to the same vertex on the next move.

<image>

In the second test case, Bob has the following strategy to win. Wherever Alice moves, Bob will always move to whichever of the two vertices 1 or 6 is farthest from Alice.

<image>
import java.io.*;
import java.util.*;
import java.util.concurrent.TimeUnit;

public class d1405 implements Runnable{
	
    public static void main(String[] args) {
    	try{
            new Thread(null, new d1405(), "process", 1<<26).start();
        }
        catch(Exception e){
            System.out.println(e);
        }
    }
	public void run() {
		FastReader scan = new FastReader();
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		//PrintWriter out = new PrintWriter("file.out");
		Task solver = new Task();
		int t = scan.nextInt();
		//int t = 1;
		for(int i = 1; i <= t; i++) solver.solve(i, scan, out);
		out.close();
	}

	static class Task {
		static final int oo = Integer.MAX_VALUE;
		static final long OO = Long.MAX_VALUE;

		static List<List<Integer>> adj = new ArrayList<>();
		public void solve(int testNumber, FastReader sc, PrintWriter out) {
			int N = sc.nextInt();
			int A = sc.nextInt();
			int B = sc.nextInt();
			int dA = sc.nextInt();
			int dB = sc.nextInt();
			
			adj.clear();
			max = 0;
			for(int i = 0; i <= N; i++) {
				adj.add(new ArrayList<>());
			}
			for(int i = 1; i < N; i++) {
				int u = sc.nextInt();
				int v = sc.nextInt();
				adj.get(u).add(v);
				adj.get(v).add(u);
			}
			
			LCA lca = new LCA(adj, 1);
			if(lca.distance(A, B) <= dA) {
				out.println("Alice");
				return;
			}
			
			if(dB <= 2 * dA) {
				out.println("Alice");
				return;
			}
			
			// Bob wins if he can keep "jumping over" Alice, which is only possible if he's more than 2 * dA, 
			// and there has to be a location where he can jump over alice in the first place
			maxDist(1, 0);
			//dbg(max);
			if(max >= 2 * dA + 1) {
				out.println("Bob");
				return;
			}
			
			out.println("Alice");
			return;
		}
		
		static int max = 0;
		public static int maxDist(int node, int parent) {
			PriorityQueue<Integer> dists = new PriorityQueue<>(Collections.reverseOrder());
			dists.add(0);
			dists.add(0);
			for(int each: adj.get(node)) {
				if(each != parent) {
					dists.add(maxDist(each, node));
				}
			}
			int a = dists.poll();
			int b = dists.peek();
			//dbg(node + " " + (a+b));
			max = Math.max(max, a + b);
			return a+1; // return the largest for further processing
		}
		
		public static class LCA {
			int N, L;
			List<List<Integer>> adjList;
			int timer;
			int[] tIn, tOut;
			int[][] up;
			int[] depth;
			
			public LCA(List<List<Integer>> adj, int root) {
				N = adj.size();
				adjList = adj;
				tIn = new int[N];
				tOut = new int[N];
				depth = new int[N];
				timer = 0;
				L = (int)Math.ceil(Math.log(N) / Math.log(2));
				up = new int[N][L+1];
				dfs(root, root, 0);
			}
			
			public void dfs(int node, int parent, int dep) {
				tIn[node] = timer++;
				up[node][0] = parent;
				for(int i = 1; i <= L; i++) {
					up[node][i] = up[up[node][i-1]][i-1];
				}
				
				depth[node] = dep;
				for(int each: adjList.get(node)) {
					if(each != parent)
						dfs(each, node, dep+1);
				}
				
				tOut[node] = timer++;
			}
			
			public boolean isAncestor(int u, int v) {
				return tIn[u] <= tIn[v] && tOut[u] >= tOut[v];
			}
			
			public int lca(int u, int v) {
				if(isAncestor(u, v))
					return u;
				if(isAncestor(v, u))
					return v;
				for(int i = L; i >= 0; i--) {
					if(!isAncestor(up[u][i], v))
						u = up[u][i];
				}
				return up[u][0];
			}
			
			public int distance(int u, int v) {
				int lca = lca(u, v);
				if(lca == u || lca == v) {
					return Math.abs(depth[v] - depth[u]);
				}
				return depth[v] - depth[lca] + depth[u] - depth[lca];
			}
		}
	}
	
	static long modDivide(long a, long b, long MOD) {
		a %= MOD;
		return (binpow(b, MOD-2, MOD) * a) % MOD;
	}
	static long binpow(long a, long b, long m) {
		a %= m;
		long res = 1;
		while (b > 0) {
			if ((b & 1) == 1)
				res = res * a % m;
			a = a * a % m;
			b >>= 1;
		}
		return res;
	}
	static int[] reverse(int a[]) 
    { 
        int[] b = new int[a.length]; 
        for (int i = 0, j = a.length; i < a.length; i++, j--) { 
            b[j - 1] = a[i]; 
        } 
        
        return b;
    }
	static long[] reverse(long a[]) 
    { 
        long[] b = new long[a.length]; 
        for (int i = 0, j = a.length; i < a.length; i++, j--) { 
            b[j - 1] = a[i]; 
        } 
        
        return b;
    }
	static void sort(int[] x){
		shuffle(x);
		Arrays.sort(x);
	}
	static void sort(long[] x){
		shuffle(x);
		Arrays.sort(x);
	}
	static class tup implements Comparable<tup>, Comparator<tup>{
		int a, b;
		tup(int a,int b){
			this.a=a;
			this.b=b;
		}
		public tup() {
		}
		@Override
		public int compareTo(tup o){
			return Integer.compare(b,o.b);
		}
		@Override
		public int compare(tup o1, tup o2) {
			return Integer.compare(o1.b, o2.b);
		}
		
		@Override
	    public int hashCode() {
			return Objects.hash(a, b);
	    }
 
	    @Override
	    public boolean equals(Object obj) {
	    	if (this == obj)
                return true;
	    	if (obj == null)
                return false;
	    	if (getClass() != obj.getClass())
                return false;
	    	tup other = (tup) obj;
	    	return a==other.a && b==other.b;
	    }
	    
	    @Override
	    public String toString() {
	    	return a + " " + b;
	    }
	}
	
	static void shuffle(int[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			int temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static void shuffle(long[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			long temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		public FastReader(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(new File(s)));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
		
		int[] readArray(int size) {
			int[] a = new int[size];
			for(int i = 0; i < size; i++) {
				a[i] = nextInt();
			}
			return a;
		}
		
		long[] readLongArray(int size) {
			long[] a = new long[size];
			for(int i = 0; i < size; i++) {
				a[i] = nextLong();
			}
			return a;
		}
	}
	
	static void dbg(int[] arr) {
		System.out.println(Arrays.toString(arr));
	}
	static void dbg(long[] arr) {
		System.out.println(Arrays.toString(arr));
	}
	static void dbg(boolean[] arr) {
		System.out.println(Arrays.toString(arr));
	}

	static void dbg(Object... args) {
        for (Object arg : args)
            System.out.print(arg + " ");
        System.out.println();
    }
}