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.io.IOException;
import java.util.*;
import java.util.function.DoublePredicate;


//import javafx.util.Pair; 
//import java.util.concurrent.LinkedBlockingDeque;







    
  public class Codeforces {
     
        
        public static long mod = (long)Math.pow(10,9)+7 ;
        public static double epsilon=0.00000000008854;//value of epsilon
        public static InputReader sc = new InputReader(System.in);
        public static PrintWriter pw = new PrintWriter(System.out);
        
        // fun(n,sum)=fun(n-1,sum)+fun(n-1,sum-n^x);
        public static int parent(int a,int p[]){
            if(a!=p[a]){
                p[a]=parent(p[a], p);
            }
            return p[a];
        }
       public static void Union(int a,int b,int p[],int size[]){
            a=parent(a, p);
            b=parent(b, p);
            if(a!=b){
                p[a]=b;
                size[b]+=size[a];
            }
       }

       //public static void dfs1(ArrayList<ArrayList<Integer>> g,int u,int vis[] )
       public static int findLengthOfShortestSubarray(int[] a) {
            TreeMap<Integer,Integer> left=new TreeMap<>();
            left.put(a[0],1);
            int ans=1;
            for(int i=1;i<a.length;i++){
                if(a[i]>=a[i-1])
                left.put(a[i], i+1);
                else{
                    break;
                }
                ans++;
            }
            int t=0;
            
            if(ans!=a.length)
            for(int i=a.length-1;i>=0;i--){
                if((i==a.length-1)||a[i]<=a[i+1]){
                    t++;
                    Integer k=left.floorKey(a[i]);
                    
                    if(k==null){
                        ans=Math.max(ans, t);
                    }
                    else{
                        //pw.println(k);
                        ans=Math.max(ans, left.get(k)+t);
                    }
                }
                else{
                    break;
                }
            }
            return a.length-ans;

        }
        public static int getXor(int k){
            pw.println(1+" "+k);
            pw.flush();
            int t=sc.nextInt();
            return t;
        }

        public static int daimeterUtil(int r,ArrayList<ArrayList <Integer>> a,int h[],int vis[]){
            vis[r]=1;
            int m1=0,m2=0,d=0;
            for(int i=0;i<a.get(r).size();i++){
                int u=a.get(r).get(i);
                if(vis[u]!=1){
                    if(h[u]+1>m1){
                        m2=m1;
                        m1=h[u]+1;
                    }
                    else if(h[u]+1>m2){
                        m2=h[u]+1;
                    }
                }
            }
            d=Math.max(m1+m2, d);
            for(int i=0;i<a.get(r).size();i++){
                int u=a.get(r).get(i);
                if(vis[u]!=1){
                    d=Math.max(daimeterUtil(u, a, h, vis), d);
                }
            }
            return d;
    
        }
        public static int hieght(int r,int h[],ArrayList<ArrayList <Integer>> a,int vis[],int p[]){//bottom Up
            vis[r]=1;
            for(int i=0;i<a.get(r).size();i++){
                int v=a.get(r).get(i);
                if(vis[v]==0){
                    p[v]=r;
                    h[r]=Math.max(h[r], 1+hieght(v, h, a, vis,p));
                }
            }
            return h[r];
        }
        public static int daimeter(int r,ArrayList<ArrayList <Integer>> a){
            int n=a.size();
            int h[]=new int[n];
            int p[]=new int[n];
            hieght(r, h, a, new int[n], p);
            //ans[0]=h[b-1];
            return daimeterUtil(r, a, h, new int[n]);
        }
        public static void hieghtBfs(int r,int h[],ArrayList<ArrayList <Integer>> a,int p[],int vis[]){/// top to bottom
            Deque<Integer> q=new LinkedList<>();
            q.add(r);
            int c=1;
            p[r]=-1;
            vis[r]=1;
            while(q.size()>0){
                int l=q.size();
                while(l-->0){
                    int v=q.remove();
                    h[v]=c;
                    for(int i=0;i<a.get(v).size();i++){
                        int u=a.get(v).get(i);
                        if(vis[u]==0){
                            p[u]=v;
                            vis[u]=1;
                            q.add(u);
                        }
                    }
                }
                c++;
            }
        }
        public static ArrayList<ArrayList <Integer>> GetGraph(int n,int m){
            ArrayList<ArrayList <Integer>> a=new ArrayList<>();
            for(int i=0;i<n;i++){
                a.add(new ArrayList<>());
            }
            for(int i=0;i<m;i++){
                int u=sc.nextInt()-1;
                int v=sc.nextInt()-1;
                a.get(u).add(v);
                a.get(v).add(u);
            } 
            return a;
        }
    
        public static void main(String[] args) {
            // code starts..
            Random rand=new Random();
            int q=sc.nextInt();
            while(q-->0){
                int n=sc.nextInt();
                int a=sc.nextInt();
                int b=sc.nextInt();
                int da=sc.nextInt();
                int db=sc.nextInt();
                ArrayList<ArrayList<Integer>> g=GetGraph(n, n-1);
                //int ans[]=new int[1];
                int d=daimeter(0, g);
                int h[]=new int[n];
                
                hieghtBfs(a-1, h, g, new int[n], new int[n]);
                //pw.println(Arrays.toString(h));
                int dist=h[b-1]-1;
                int maxh=d/2+d%2;
                ///pw.println(dist +" dflh "+maxh+" "+a+" "+b);
                db=Math.min(d, db);
                
                if(dist<=da){
                    pw.println("Alice");
                }
                else if(db<=2*da){
                    pw.println("Alice");
                }
                else{
                    pw.println("Bob");
                }
                //pw.println(d);
                
                

            }
            // Code ends...
            pw.flush();
            pw.close();
        }
       
        public static Comparator<Long[]> column(int i){
            return 
            new Comparator<Long[]>() {
                @Override
                public int compare(Long[] o1, Long[] o2) {
                    return o1[i].compareTo(o2[i]);//for ascending
                    //return o2[i].compareTo(o1[i]);//for descending
                }
            };
        }
        public static Comparator<Integer[]> col(int i){
            return 
            new Comparator<Integer[]>() {
                @Override
                public int compare(Integer[] o1, Integer[] o2) {
                    return o1[i].compareTo(o2[i]);//for ascending
                    //return o2[i].compareTo(o1[i]);//for descending
                }
            };
        }
        public static Comparator<Integer> des(){
            return 
            new Comparator<Integer>() {
                @Override
                public int compare(Integer o1, Integer o2) {
                    //return o1[i].compareTo(o2[i]);//for ascending
                    return o2.compareTo(o1);//for descending
                }
            };
        }
        
        
        
        
        public static String reverseString(String s){
            StringBuilder input1 = new StringBuilder(); 
            input1.append(s);  
            input1 = input1.reverse();
            return input1.toString();
        }
        public static int[] scanArray(int n){
            int a[]=new int [n];
            for(int i=0;i<n;i++)
            a[i]=sc.nextInt();
    
            return a;
        }
        public static long[] scanLongArray(int n){
            long a[]=new long [n];
            for(int i=0;i<n;i++)
            a[i]=sc.nextLong();
    
            return a;
        }
        public static String [] scanStrings(int n){
            String a[]=new String [n];
            for(int i=0;i<n;i++)
            a[i]=sc.nextLine();
    
            return a;
        }
        public static class InputReader {
    
            private final InputStream stream;
            private final byte[] buf = new byte[8192];
            private int curChar, snumChars;
            private SpaceCharFilter filter;
    
            public InputReader(InputStream stream) {
                this.stream = stream;
            }
    
            public int snext() {
                if (snumChars == -1)
                    throw new InputMismatchException();
                if (curChar >= snumChars) {
                    curChar = 0;
                    try {
                        snumChars = stream.read(buf);
                    } catch (IOException e) {
                        throw new InputMismatchException();
                    }
                    if (snumChars <= 0)
                        return -1;
                }
                return buf[curChar++];
            }
    
            public int nextInt() {
                int c = snext();
                while (isSpaceChar(c)) {
                    c = snext();
                }
                int sgn = 1;
                if (c == '-') {
                    sgn = -1;
                    c = snext();
                }
                int res = 0;
                do {
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = snext();
                } while (!isSpaceChar(c));
                return res * sgn;
            }
    
            public long nextLong() {
                int c = snext();
                while (isSpaceChar(c)) {
                    c = snext();
                }
                int sgn = 1;
                if (c == '-') {
                    sgn = -1;
                    c = snext();
                }
                long res = 0;
                do {
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = snext();
                } while (!isSpaceChar(c));
                return res * sgn;
            }
    
            public int[] nextIntArray(int n) {
                int a[] = new int[n];
                for (int i = 0; i < n; i++) {
                    a[i] = nextInt();
                }
                return a;
            }
    
            public String readString() {
                int c = snext();
                while (isSpaceChar(c)) {
                    c = snext();
                }
                StringBuilder res = new StringBuilder();
                do {
                    res.appendCodePoint(c);
                    c = snext();
                } while (!isSpaceChar(c));
                return res.toString();
            }
    
            public String nextLine() {
                int c = snext();
                while (isSpaceChar(c))
                    c = snext();
                StringBuilder res = new StringBuilder();
                do {
                    res.appendCodePoint(c);
                    c = snext();
                } while (!isEndOfLine(c));
                return res.toString();
            }
    
            public boolean isSpaceChar(int c) {
                if (filter != null)
                    return filter.isSpaceChar(c);
                return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
            }
    
            private boolean isEndOfLine(int c) {
                return c == '\n' || c == '\r' || c == -1;
            }
    
            public interface SpaceCharFilter {
                public boolean isSpaceChar(int ch);
            }
        }
        
    }
    class SegmentTree{
    int s[],n;
    
    int li[];
    long qn[];
	SegmentTree(int a[],long q[]){
        n=a.length;
        qn=q;
        li=a;
		int l=(int)Math.ceil(Math.log(n)/Math.log(2));
		l=2*(int)Math.pow(2,l)-1;
		s=new int[l];
		createSegmentTreeUtil(a, 0, 0, a.length-1);
	}
	
	int createSegmentTreeUtil(int a[],int root,int l,int r){
		if(l==r)
		s[root]=l;
		else
		s[root]= Compare(createSegmentTreeUtil(a, 2*root+1, l, (l+r)/2), createSegmentTreeUtil(a,2*root+2, (l+r)/2+1,r));
		return s[root];
	}
	int getValue(int gl,int gr){
		return getValueUtil(0, 0, n-1, gl, gr);
	}
	int getValueUtil(int root,int l,int r,int gl,int gr){
		if(l>=gl&&r<=gr){
			return s[root];
		}
		if(l>gr||r<gl){
			return n;
		}
		return Compare(getValueUtil(2*root+1, l, (l+r)/2, gl, gr), getValueUtil(2*root+2, (l+r)/2+1, r, gl, gr));
	}
	void update(int p,int k){
		updateUtil(p, k,0,0,n-1);
	}
	int updateUtil(int p,int k,int root,int l,int r){
		if(l==r&&l==k){
			return s[root]=p;
		}
		else if(l>k||r<k)
		return s[root];
		else{
			return s[root]=Compare(updateUtil(p, k, 2*root+1, l, (l+r)/2), updateUtil(p, k, 2*root+2,(l+r)/2+1,r ));
		}
	}
	int Compare(int a,int b){
        if(a>=n&&b>=n){
            System.out.println("adfna");
        }
        
		if(a>=n){
            return b;
        }
        if(b>=n){
            return a;
        }
        if(li[a]==li[b]){
            if(qn[a]>qn[b]){
                return a;
            }
            else return b;
        }
        else if(li[a]<li[b])
        return b;
        else return a;


	}
}

    
    
        
    