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

typedef vector<vector<int>> gr;
typedef pair<int, int> pii;

inline int bfs(gr &graf, int kezdo, vector<int> &tavok)
{
    queue<int> next;
    next.push(kezdo);

    int i;
    while(!next.empty())
    {
        i = next.front();
        next.pop();

        for(auto &x : graf[i])
        {
            if(tavok[x] > -1) continue;

            next.push(x);
            tavok[x] = tavok[i]+1;
        }
    }

    return i;
}

inline pii bfsm(gr &graf, int kezdo, stack<int> &path)
{
    queue<int> next;
    next.push(kezdo);
    vector<int> tavok(graf.size(), -1);
    vector<int> prev(graf.size(), -1);

    int i, j;
    while(!next.empty())
    {
        i = next.front();
        next.pop();

        for(auto &x : graf[i])
        {
            if(tavok[x] > -1) continue;

            prev[x] = i;
            next.push(x);
            tavok[x] = tavok[i]+1;
        }
    }

    j = tavok[i]/2;

    while(j--)
    {
        i = prev[i];
    }
 
    j = ((tavok[i] & 1)^1) ? tavok[i]+1 : tavok[i];

    return {i, j};
}

int jerry(gr &graf, int j, int &t, vector<int> &tomtavok)
{
    vector<int> jertavok(graf.size(), -1);
    jertavok[j] = 0;

    queue<int> next;
    next.push(j);

    int i, m = -1;
    while(!next.empty())
    {
        i = next.front();
        next.pop();

        for(auto &x : graf[i])
        {
            if(jertavok[x] > -1 || tomtavok[x] <= jertavok[i]+2) continue;

            next.push(x);
            jertavok[x] = jertavok[i]+1;
        }
    }

    return jertavok[i];
}

int main()
{
    int T;
    cin >> T;

    int n, t, j, k, nn, a, b;
    stack<int> p;
    pii kozep;

    while(T--)
    {
        cin >> n >> t >> j >> k;
        j--;
        t--;
        nn = n-1;

        gr graf(n);
        
        vector<int> tomtavok(n, -1);
        tomtavok[t] = 0;

        while(nn--)
        {
            cin >> a >> b;

            a--; b--;
            graf[a].push_back(b);
            graf[b].push_back(a);

        }

        nn = t;
        
        nn = bfs(graf, nn, tomtavok);

        if(tomtavok[j] <= k)
        {
            cout << "IGEN\n";
            continue;
        }

        if(jerry(graf, j, t, tomtavok) < k)
        {
            cout << "IGEN\n";
            continue;
        }

        kozep = bfsm(graf, nn, p);

        cout << (kozep.second <= k ? "IGEN" : "NEM") << "\n";
    }

    return 0;
}