#include <bits/stdc++.h>
using namespace std;


typedef long long ll;
typedef unsigned long long ull;
typedef vector<vector<ll>> vvll;
typedef vector<long long> vll;
typedef vector<pair<ll,ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqrll;
#define fr(i,n,a) for(long long i=a; i<n; i++)
#define ufr(i,n,a) for(long long i=n-1; i>=a; i--)
#define vout(v) for(auto &e:v){cout<<e<<" ";} cout<<"\n";
#define mout(mp) for(auto &e:mp){cout<<e.first<<"------>"<<e.second<<"\n";} cout<<endl;
#define mvout(mp) for(auto &e:mp){cout<<e.first<<"----->\n"; for(long long i =0 ; i<(e.second).size();i++){cout<<(e.second)[i]<<" ";} cout<<"\n";} cout<<"\n";
#define Sort(a) sort(a.begin(),a.end())
#define all(a) a.begin(),a.end()
#define Sorta(a,n) sort(a,a+n)
#define pb push_back  
#define F first
#define S second 
const ll M = 1000000000+7;
struct LCA {
    vector<ll> height, euler, first, segtree;
    vector<bool> visited;
    ll n;

    LCA(vector<vector<ll>> &adj, ll root = 0) {
        n = adj.size();
        height.resize(n);
        first.resize(n);
        euler.reserve(n * 2);
        visited.assign(n, false);
        dfs(adj, root);
        ll m = euler.size();
        segtree.resize(m * 4);
        build(1, 0, m - 1);
    }

    void dfs(vector<vector<ll>> &adj, ll node, ll h = 0) {
        visited[node] = true;
        height[node] = h;
        first[node] = euler.size();
        euler.push_back(node);
        for (auto to : adj[node]) {
            if (!visited[to]) {
                dfs(adj, to, h + 1);
                euler.push_back(node);
            }
        }
    }

    void build(ll node, ll b, ll e) {
        if (b == e) {
            segtree[node] = euler[b];
        } else {
            ll mid = (b + e) / 2;
            build(node << 1, b, mid);
            build(node << 1 | 1, mid + 1, e);
            ll l = segtree[node << 1], r = segtree[node << 1 | 1];
            segtree[node] = (height[l] < height[r]) ? l : r;
        }
    }

    ll query(ll node, ll b, ll e, ll L, ll R) {
        if (b > R || e < L)
            return -1;
        if (b >= L && e <= R)
            return segtree[node];
        ll mid = (b + e) >> 1;

        ll left = query(node << 1, b, mid, L, R);
        ll right = query(node << 1 | 1, mid + 1, e, L, R);
        if (left == -1) return right;
        if (right == -1) return left;
        return height[left] < height[right] ? left : right;
    }

    ll lca(ll u, ll v) {
        ll left = first[u], right = first[v];
        if (left > right)
            swap(left, right);
        return query(1, 0, euler.size() - 1, left, right);
    }
};
ll dist[200005];
void dfss(ll v,vvll&g,ll p,ll dis){
    dist[v]=dis;

    for(auto &e:g[v]){
        if(e==p){
            continue;

        }
        dfss(e,g,v,dis+1);

    }
}



void solve(){
    ll n;
    cin>>n;
    ll a[3];
    fr(i,3,0){
        cin>>a[i];


    }
    vvll v(n+1,vll());
    fr(i,n-1,0){
        ll s1,s2;
        cin>>s1>>s2;
        v[s2].pb(s1);
        v[s1].pb(s2);

    }
    fr(i,n+4,0){
        dist[i]=0;

    }

    LCA lcaSolver(v,a[0]);
    ll lca = lcaSolver.lca(a[1],a[2]);
    dfss(a[0],v,-1,0);
    // cout<<lca<<"\n";


    ll dist1=abs(dist[a[0]]-dist[lca]);
    ll dist2=abs(dist[a[1]]-dist[lca]);
    ll dist3=abs(dist[a[2]]-dist[lca]);
    ll mn=min(dist1,min(dist2,dist3));


    if((dist1-dist2==1 && dist2== dist3 && mn!=0) || (dist1-dist2==0 &&  dist1-dist3<=1 && mn!=0) ){
        cout<<"DRAW\n";

    }else if(dist1==mn && dist2>mn){
        cout<<"A\n";
    }else if(dist2==mn && dist3>mn){
        cout<<"B\n";
    }else{
        if(lca==a[2] && dist1==1){
            cout<<"A\n";

        }else{
            cout<<"C\n";

        }
        

    }


    
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;
    cin>>t;
    ll counter =1;

    while(t--){
        //cout<<"Case #"<<counter<<": ";
        solve();
        counter++;

    }
    return 0;

}