#include <iostream>
#include <queue>
#include <vector>
#include <list>

using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, q;

        cin >> n >> q;

        int *parent = (int*)calloc(n + 1, sizeof(int));
        int *team = (int*)calloc(n + 1, sizeof(int));
        vector<list<int>> child;
        child.resize(n + 1);

        parent[1] = -1;
        parent[2] = -1;
        team[1] = 1;
        team[2] = 2;

        for (int i = 0; i < n - 2; i++)
        {
            int a, b;
            cin >> a >> b;
            parent[b] = a;
            child[a].push_back(b);
            team[b] = team[a];
        }


        for (int i = 0; i < q; i++)
        {
            char tq;
            int a, b;
            cin >> tq;
            if (tq == 'T')
            {
                cin >> a;

                queue<int> search;
                search.push(a);
                while (!search.empty())
                {
                    int p = search.front();
                    search.pop();

                    if (team[p] == 1)
                    {
                        team[p] = 2;
                    }
                    else
                        team[p] = 1;

                    for (list<int>::iterator it = child[p].begin(); it != child[p].end(); it++)
                    {
                        search.push(*it);
                    }
                }
            }
            else
            {
                cin >> a >> b;
                if (team[a] == team[b])
                    cout << "Ally\n";
                else
                    cout << "Enemy\n";
            }
        }

    }

    return 0;
}