#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
ifstream fin("nfa.in");
ofstream fout("nfa.out");
const int NMAX = 300;
struct graf{
    int nod;
    char ch;
};
vector<graf>g[NMAX+5];
string sir;
bitset <NMAX+5>finale;
bool dfs(int nod, int index)
{
    int i;
    if(index == sir.size())
       return finale[nod];
    bool ok = false;
    for(i=0;i<g[nod].size(); i++)
    {
        if(g[nod][i].ch == sir[index])
            {
                ok = dfs(g[nod][i].nod, index+1);
                if(ok == true)
                    break;
            }
    }
    return ok;

}
int main()
{
   int n, m, k, s, i, x, y, q;
   fin>>n>>m>>k>>s;
   graf aux;
   for(i=1;i<=k;i++)
   {
       fin>>x;
       finale[x]=1;
   }
   for(i=1;i<=m;i++)
   {
       fin>>x>>y>>sir;
       aux.ch = sir[0];
       aux.nod =y;
       g[x].push_back(aux);
   }
   fin>>q;
   for(i=1;i<=q;i++)
   {
      fin>>sir;
      fout<<dfs(s, 0)<<"\n";
   }



    return 0;
}