#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 300005,K=20;
constexpr int P = 998244353;
using namespace std;
vector<int> v[N];
int n,A[3],B[3],dep[N],fa[N];
#define For(i,l,r) for(int i=l;i<=(int)(r);i++)
#define pb push_back
int lca(int x,int y){
    static int vis[N];
    For(i,1,n)vis[i]=0;
    for(int i=x;i;i=fa[i]){vis[i]=1;}
    for(int i=y;i;i=fa[i])if(vis[i])return i;
    assert(0);
}
void dfs(int p){
    //cerr<<p<<" "<<fa[p]<<endl;
    dep[p]=dep[fa[p]]+1;
    for(auto i:v[p])if(i!=fa[p]){
        fa[i]=p;
        dfs(i);
    }
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T;
    cin>>T;
    while(T--){
        cin>>n;
        For(i,1,n)v[i].clear();
        For(i,0,2)cin>>A[i];
        For(i,1,n-1){
            int s,t;
            cin>>s>>t;
            v[s].pb(t);
            v[t].pb(s);
        }
        fa[A[0]]=0; 
        dfs(A[0]);
        int x=lca(A[1],A[2]);
        B[0]=dep[x]-dep[A[0]];
        B[1]=dep[A[1]]-dep[x];
        B[2]=dep[A[2]]-dep[x];
        //cerr<<B[0]<<" "<<B[1]<<" "<<B[2]<<"\n";
        int fl=1;
        For(o,0,2){
            int cnt=0;
            For(oo,0,2)if(oo!=o){
                cnt+=(B[oo]-B[o]>=(o<oo?0:1)+((o+1)%3==oo?1:-1));
                //if(o==0)cerr<<B[oo]-B[o]<<" "<<(o<oo?0:1)+((o+1)%3==oo?-1:1)<<endl;
            }
            if(cnt==2){
                fl=0;
                if(o==0)cout<<"A"<<endl;
                else if(o==1)cout<<"B"<<endl;
                else cout<<"C"<<endl;
                break;
            }
        }
        if(fl)cout<<"DRAW"<<endl;
    }
    return 0;
}