#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;

const int S = 1'000'006;
const int sigma = 26;
const char base = 'A';

struct AhoCorasick
{
    int ch[S][sigma] = {{}}, f[S] = {-1}, tag[S], mv[S][sigma], jump[S], cnt[S];
    int idx = 0, t = -1;
    vector<int> E[S], q;
    pii o[S];
    int insert(string &s)
    {
        int j = 0;
        for (int i = 0; i < (int)s.size(); i++)
        {
            if (!ch[j][s[i] - base])   
                ch[j][s[i] - base] = ++idx;
            j = ch[j][s[i] - base];
        }
        tag[j] = 1;
        return j;
    }
    int next(int u, int c)
    {
        return u < 0 ? 0 : mv[u][c];
    }
    void dfs(int u)
    {
        o[u].F = ++t;
        for (auto v : E[u]) dfs(v);
        o[u].S = t;
    }
    void build()
    {
        int k = -1;
        q.emplace_back(0);
        while (++k < (int)q.size())
        {
            int u = q[k];
            for (int v = 0; v < sigma; v++)
            {
                if (ch[u][v])
                {
                    f[ch[u][v]] = next(f[u], v);
                    q.emplace_back(ch[u][v]);
                }
                mv[u][v] = (ch[u][v] ? ch[u][v] : next(f[u], v));
            }
            if (u) jump[u] = (tag[f[u]] ? f[u] : jump[f[u]]);
        }
        reverse(all(q));
        for (int i = 1; i <= idx; i++)
            E[f[i]].emplace_back(i);
        dfs(0);
    }
    void prequery()
    {
        fill(cnt, cnt + idx + 1, 0);
    }
    void finalize()
    {
        for (int i : q)
            if (f[i] > 0) cnt[f[i]] += cnt[i];
    }
} ac;

int n, p[S], q, idx[S], state[S];
char c[S];
string s[S];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> c[i] >> p[i];
    for (int i = 1; i <= q; i++)
    {
        cin >> s[i];
        reverse(all(s[i]));
        idx[i] = ac.insert(s[i]);
    }
    ac.build();
    ac.prequery();
    for (int i = 1; i <= n; i++)
    {
        state[i] = ac.next(state[p[i]], c[i] - base);
        ac.cnt[state[i]]++;
    }
    ac.finalize();
    for (int i = 1; i <= q; i++)
        cout << ac.cnt[idx[i]] << '\n';

}

/*
10 5
S 0
Y 1
R 2
E 3
N 4
E 5
A 6
D 7
Y 7
R 9
RY
E
N
S
AY

*/