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

#define InTheNameOfGod cin.tie(0); cout.tie(0); ios::sync_with_stdio(0);

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

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

    long 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 long bfsm(gr &graf, long kezdo)
{
    queue<long> next;
    next.push(kezdo);
    vector<long> tavok(graf.size(), -1);

    long i, j;
    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;
        }
    }

    j = tavok[i]/2;
 
    //j = (j & 1)^1 ? j+1 : j;

    return j;
}

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

    queue<long> next;
    next.push(j);
    long m = j;

    long i;
    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;
            m = tomtavok[m] > tomtavok[x] ? m : x;
        }
    }
    return m > -1 ? tomtavok[m] : tomtavok[i];
}

int main()
{

    InTheNameOfGod

    long T;
    cin >> T;

    long n, t, j, k, nn, a, b;
    long kozep;

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

        gr graf(n);
        
        vector<long> 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] == 1)
        {
            cout << "IGEN\n";
            continue;
        }

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

        kozep = bfsm(graf, nn);

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

    return 0;
}