#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;

constexpr int SZ = 26;

struct GSAM {
  vector<vector<int>> e = {vector<int>(SZ)};  // the labeled edges from node i
  vector<int> parent = {-1};                  // the parent of i
  vector<int> length = {0};                   // the length of the longest string

  GSAM(int n) { e.reserve(2 * n), parent.reserve(2 * n), length.reserve(2 * n); };
  int extend(int c, int p) {  // character, last
    bool f = true;            // if already exist
    int r = 0;                // potential new node
    if (!e[p][c]) {           // only extend when not exist
      f = false;
      e.push_back(vector<int>(SZ));
      parent.push_back(0);
      length.push_back(length[p] + 1);
      r = (int)e.size() - 1;
      for (; ~p && !e[p][c]; p = parent[p]) e[p][c] = r;  // update parents
    }
    if (f || ~p) {
      int q = e[p][c];
      if (length[q] == length[p] + 1) {
        if (f) return q;
        parent[r] = q;
      } else {
        e.push_back(e[q]);
        parent.push_back(parent[q]);
        length.push_back(length[p] + 1);
        int qq = parent[q] = (int)e.size() - 1;
        for (; ~p && e[p][c] == q; p = parent[p]) e[p][c] = qq;
        if (f) return qq;
        parent[r] = qq;
      }
    }
    return r;
  }
};

int main() {
  std::cin.tie(nullptr)->sync_with_stdio(false);
  int n, k;
  std::cin >> n >> k;

  std::vector<int> cnt, id(n);
  auto gsam = GSAM(n);
  for (int i = 0, parent; i < n; i++) {
    char c;
    std::cin >> c >> parent, parent--;
    id[i] = gsam.extend(c - 'A', (parent == -1 ? 0 : id[parent]));
    if (cnt.size() < gsam.e.size()) {
      cnt.resize(gsam.e.size());
    }
    cnt[id[i]]++;
  }

  ll sz = gsam.e.size();
  vector<int> c(sz + 1);
  vector<int> order(sz);
  for (int i = 1; i < sz; i++) c[gsam.length[i]]++;
  for (int i = 1; i < sz; i++) c[i] += c[i - 1];
  for (int i = 1; i < sz; i++) order[c[gsam.length[i]]--] = i;
  reverse(order.begin(), order.end());  // reverse so that large len to small

  for (auto i : order) {
    if (gsam.parent[i] != -1) {
      cnt[gsam.parent[i]] += cnt[i];
    }
  }

  while (k--) {
    std::string s;
    std::cin >> s;
    reverse(s.begin(), s.end());
    int m = int(s.size()), p = 0;
    [&] {
      for (int i = 0; i < m; i++) {
        int c = s[i] - 'A';
        if (gsam.e[p][c] == 0) {
          std::cout << "0\n";
          return;
        }
        p = gsam.e[p][c];
      }
      std::cout << cnt[p] << "\n";
    }();
  }
}