#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 2e6 + 5;

int n, m, q[N], head[N], numE = 0;
int pos[N], w[N], tr[N][26], fail[N], idx;

char s[N];

struct E{
	int next, v;
} e[N];

void inline add(int u, int v) {
	e[++numE] = (E) { head[u], v };
	head[u] = numE;
}

void inline build() {
	int hh = 0, tt = -1;
	for (int i = 0; i < 26; i++) 
		if (tr[0][i]) q[++tt] = tr[0][i];
	while (hh <= tt) {
		int u = q[hh++];
		for (int i = 0; i < 26; i++) {
			int &v = tr[u][i];
			if (v) {
				q[++tt] = v, fail[v] = tr[fail[u]][i];
			} else v = tr[fail[u]][i];
		}
	}
}

void dfs(int u) {
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v;
		dfs(v);
		w[u] += w[v];
	}
}

int main() {
	scanf("%d%d", &n, &m); idx = n;
	for (int i = 1; i <= n; i++) {
		int p; scanf("%s%d", s, &p);
		tr[p][*s - 'A'] = i, w[i] = 1;
	}
	for (int i = 1; i <= m; i++) {
		scanf("%s", s + 1); int len = strlen(s + 1);
		reverse(s + 1, s + 1 + len);
		int p = 0;
		for (int j = 1; j <= len; j++) {
			int ch = s[j] - 'A';
			if (!tr[p][ch]) tr[p][ch] = ++idx;
			p = tr[p][ch];
		}
		pos[i] = p;
	}
	build();
	for (int i = 1; i <= idx; i++) add(fail[i], i);
	dfs(0);
	for (int i = 1; i <= m; i++) printf("%d\n", w[pos[i]]);
	return 0;
}