#include <fstream>
#include <vector>
#include <string>
#include <queue>
using namespace std;

#define MAXN 300

ifstream in ("nfa.in");
ofstream out ("nfa.out");

int stare_finala[301];

struct vecin
{
    int nrnod;
    char valmuchie;
};
vector <vecin> liste_vecini[1 + MAXN];

struct el_coada
{
    int nrnod;
    int parcurs;
};
queue <el_coada> q;

int main(){
    int N, M, K, x, i, q1, q2, Q, S;
    char c;
    string cuvant;

    in >> N >> M >> K >> S;
    for (i=0; i<K; i++)
    {
        in>>x;
        stare_finala[x]=1;
    }

    for (i=0; i<M; i++)
    {
        in>>q1>>q2>>c;
        liste_vecini[q1].push_back({q2, c});
    }
    in >> Q;
    for (i=0; i<Q; i++)
    {
        in>>cuvant;
        int lungime = (int)(cuvant.length());
        int acceptat = 0;
        while(!q.empty()) q.pop();
        q.push({S, 0});
        while (q.empty() == 0)
        {
            int nodcurent, parcurs;
            nodcurent = q.front().nrnod;
            parcurs = q.front().parcurs;

            q.pop();
            for (vecin x : liste_vecini[nodcurent])
            {
                if (x.valmuchie == cuvant[parcurs])
                {
                    if(parcurs + 1 < lungime)
                        q.push({x.nrnod, parcurs + 1});
                    else if(stare_finala[x.nrnod]){
                        acceptat = 1;
                        break;
                    }
                }
            }
        }
        out<<acceptat<<"\n";
    }
    return 0;
}