#include <bits/stdc++.h>

using namespace std;


int main()
{
    //ifstream cin("be.txt");
    int n, m, t, k, e;
    cin>>n>>m>>t>>k>>e;
    t--;
    e--;

    vector<vector<int>> tSzL(n),
    jSzL(n);

    for(int i=0; i<m; i++){
        int s, f, mass;
        cin>>s>>f>>mass;
        s--; f--;
        jSzL[s].push_back(f);
        jSzL[f].push_back(s);
        if(mass == 2){
            tSzL[s].push_back(f);
            tSzL[f].push_back(s);
        }
    }


    ///Tom szelessegi
    vector<int> tom(n, -1);
    queue<int> qT;
    qT.push(t);
    tom[t] = 0;
    while(!qT. empty()){
        int a = qT.front();
        qT.pop();
        for(int i=0; i<tSzL[a].size(); i++){
            if(tom[tSzL[a][i]] == -1){
                qT.push(tSzL[a][i]);
                tom[tSzL[a][i]] = tom[a]+1;
            }
        }
    }

    ///jerry szelesseg
    while(k--){
        int j; cin>>j;
        j--;
        vector<int> jerry(n, -1);
        queue<int> qJ;
        qJ.push(j);
        jerry[j] = 0;
        while(!qJ. empty()){
            int a = qJ.front();
            qJ.pop();
            for(int i=0; i<jSzL[a].size(); i++){
                if(jerry[jSzL[a][i]] == -1 && (tom[jSzL[a][i]]==-1 ||
                   jerry[a] + 1 < tom[jSzL[a][i]])){
                    qJ.push(jSzL[a][i]);
                    jerry[jSzL[a][i]] = jerry[a] + 1;
                }
            }
        }

        if(jerry[e] != -1) cout<<"IGEN"<<'\n';
        else cout<<"NEM"<<'\n';
    }




    return 0;
}