#include <bits/stdc++.h>
#define GOTTAGOFAST cin.tie(0); ios::sync_with_stdio(0);

using namespace std;

typedef vector<vector<int>> adj;

queue<int> nex;

inline void tombejar(adj &tom, vector<int> &tomtav, int &t)
{
    nex.push(t);
    tomtav[t] = 0;

    while(!nex.empty())
    {
        int& curr = nex.front();
        for(auto &x : tom[curr])
        {
            if(tomtav[x] > tomtav[curr]+1)
            {
                nex.push(x);
                tomtav[x] = tomtav[curr]+1;
            }
        }
        nex.pop();
    }
}

inline bool jerrybejar(adj &jerry, vector<int> &tomtav, vector<int> &jerrytav, int &j, int &c)
{
    nex = {};
    fill(jerrytav.begin(), jerrytav.end(), 200000);

    nex.push(j);
    jerrytav[j] = 0;

    while(!nex.empty())
    {
        int& curr = nex.front();
        for(auto &x : jerry[curr])
        {
            if(jerrytav[x] > jerrytav[curr]+1 && jerrytav[curr]+1 < tomtav[x])
            {
                if(x == c) return true;
                nex.push(x);
                jerrytav[x] = jerrytav[curr]+1;
            }
        }
        nex.pop();
    }
    return false;
}

int main()
{
    GOTTAGOFAST

    int n, m, t, j, jp, e;
    int a, b, s;
    cin >> n >> m >> t >> jp >> e;
    e--;

    adj tom(n);
    vector<int> tom_tav(n, 200000);
    adj jerry(n);
    vector<int> jerry_tav(n);

    for(;m--;)
    {
        cin >> a >> b >> s;
        a--;
        b--;
        jerry[a].push_back(b);
        jerry[b].push_back(a);
        if(s == 2)
        {
            tom[a].push_back(b);
            tom[b].push_back(a);
        }
    }

    tombejar(tom, tom_tav, (--t));

    for(;jp--;)
    {
        cin >> j;
        j--;
        if(j == t)
        {
            cout << "NEM\n";
            continue;
        }
        if(j == e)
        {
            cout << "IGEN\n";
            continue;
        }
        cout << (jerrybejar(jerry, tom_tav, jerry_tav, j, e) ? "IGEN\n" : "NEM\n");
    }

    return 0;
}