#include <iostream>
#include <fstream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <queue>

std::ifstream fin("nfa.in");
std::ofstream fout("nfa.out");

class NFA {
public:
    void readInput();
    bool isWordAccepted(const std::string &word);
private:
    std::vector<std::vector<std::pair<int, int>>>m_graph;
    std::unordered_set<int>m_stariFinale;
    int m_stareInitiala;
};

void NFA::readInput() {
    int nrStari, nrTranzitii, nrStariFinale;

    fin>>nrStari>>nrTranzitii>>nrStariFinale;
    fin>>m_stareInitiala;
    m_graph.resize(nrStari+1);
    for(int i = 0; i < nrStariFinale; i++) {
        int stareFinala;
        fin>>stareFinala;
        m_stariFinale.insert(stareFinala);
    }
    for(int i = 0; i < nrTranzitii; i++) {
        int x, y;
        char l;
        fin>>x>>y>>l;
        m_graph[x].emplace_back(y, l);
    }
}

bool NFA::isWordAccepted(const std::string &word) {
    std::queue<std::pair<int, int>> nodes_to_visit;

    nodes_to_visit.emplace(m_stareInitiala, 0);

    while(!nodes_to_visit.empty()) {
        const std::pair<int, int> fr = nodes_to_visit.front();
        const int currentNode = fr.first;
        const int position = fr.second;

        nodes_to_visit.pop();

        if(position == word.length()) {
            if(m_stariFinale.find(currentNode) != m_stariFinale.end()) {
                return true;
            }
        }

        for(const auto &it: m_graph[currentNode]) {
            if(it.second == word[position]) {
                nodes_to_visit.emplace(it.first, position + 1);
            }
        }
    }

    return false;
}

int main() {
    NFA nfa;

    nfa.readInput();

    int nrCuvinte;
    fin>>nrCuvinte;
    for(int i = 0; i < nrCuvinte; i++) {
        std::string word;
        fin>>word;
        fout<<nfa.isWordAccepted(word)<<'\n';
    }

    return 0;
}