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

using namespace std;

int main()
{
    //beolvasas
    int n, m, t, p, e;
    cin >> n >> m >> t >> p >> e;
    t--;
    e--;
    vector<int> jar1[n], jar2[n];
    int a, b, s, k[p];
    for(int i=0; i<m; i++)
    {
        cin >> a >> b >> s;
        a--; b--;
        if(s==1)
        {
            jar1[a].push_back(b);
            jar1[b].push_back(a);
        }
        else
        {
            jar1[a].push_back(b);
            jar1[b].push_back(a);
            jar2[a].push_back(b);
            jar2[b].push_back(a);
        }
    }
    //cout << "Ce e problema";
    for(int i=0; i<p; i++)
    {
        cin >> k[i];
        k[i]--;
    }

    //tom
    int tid[n], x;
    for(int i=0; i<n; i++)
    {
        tid[i]=-1;
    }
    queue<int> q;
    tid[t]=0;
    q.push(t);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0; i<jar2[x].size(); i++)
        {
            if(tid[jar2[x][i]]==-1)
            {
                tid[jar2[x][i]]=tid[x]+1;
                q.push(jar2[x][i]);
            }
        }
    }

    //egerke
    int jid[n];
    for(int i=0; i<p; i++)
    {
        for(int j=0; j<n; j++)
        {
            jid[j]=-1;
        }
        jid[k[i]]=0;
        q.push(k[i]);
        while(!q.empty())
        {
            x=q.front();
            q.pop();
            for(int j=0; j<jar1[x].size(); j++)
            {
                if(jid[jar1[x][j]]==-1 and (!(tid[jar1[x][j]]<=jid[x]+1) or tid[jar1[x][j]]==-1))
                {
                    jid[jar1[x][j]]=jid[x]+1;
                    q.push(jar1[x][j]);
                }
            }
        }
        if(jid[e]!=-1)
        {
            cout << "IGEN" << endl;
        }
        else
        {
            cout << "NEM" << endl;
        }
    }
    return 0;
}