#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
const int mod = (1e9) + 7, mod2 = 998244353;
const long double eps = 1e-10;
const int siz = 4e5 + 5, siz2 = 2e5 + 5, lg = 20, block = 710, block2 = 1000,
          mxv = 5e5, sqrt_mod = 31630;
const int alpha_sz = 26;
int n, m, qry_to_node[siz], dfs_co, ord[siz], l[siz], r[siz], ans[siz],
    bit[siz];
char qry_txt[siz];
vector<int> leaf_adj[siz];
struct song_node {
  vector<pair<int, int> > chldrn;
  vector<int> qry_inds;
};
song_node song_nodes[siz];
struct qry_node {
  int par, go[alpha_sz], suff_link, last_qry, prev_char;
  bool leaf;
  void comm() {
    suff_link = last_qry = -1;
    leaf = 0;
    fill(begin(go), end(go), -1);
  }
  qry_node() {
    par = prev_char = -1;
    comm();
  }
  qry_node(int par, char prev_char) {
    this->par = par;
    this->prev_char = prev_char;
    comm();
  }
};
vector<qry_node> qry_nodes(1);
void add_qry_txt(char qry_txt[], int ind) {
  int sz = strlen(qry_txt), cur = 0;
  for (int i = 0; i < sz; i++) {
    int c = qry_txt[i] - 'a';
    if (qry_nodes[cur].go[c] == -1) {
      qry_nodes[cur].go[c] = qry_nodes.size();
      qry_nodes.push_back(qry_node(cur, c));
    }
    cur = qry_nodes[cur].go[c];
  }
  qry_nodes[cur].leaf = 1;
  qry_to_node[ind] = cur;
}
int go(int node, int c);
int get_link(int node) {
  qry_node &qn = qry_nodes[node];
  if (qn.suff_link != -1) {
    return qn.suff_link;
  }
  if (node == 0) {
    qn.suff_link = qn.last_qry = 0;
    return 0;
  } else {
    qn.suff_link = qn.par ? go(get_link(qn.par), qn.prev_char) : 0;
  }
  get_link(qn.suff_link);
  int prev_last_qry = qry_nodes[qn.suff_link].last_qry;
  qn.last_qry = qn.leaf ? node : prev_last_qry;
  if (qn.leaf) {
    leaf_adj[node].push_back(prev_last_qry);
    leaf_adj[prev_last_qry].push_back(node);
  }
  return qn.suff_link;
}
int go(int node, int c) {
  qry_node &qn = qry_nodes[node];
  if (qn.go[c] != -1) {
    return qn.go[c];
  }
  if (node == 0) {
    qn.go[c] = 0;
  } else {
    qn.go[c] = go(get_link(node), c);
  }
  return qn.go[c];
}
void calc_links() {
  int sz = qry_nodes.size();
  for (int i = 0; i < sz; i++) {
    get_link(i);
    for (int j = 0; j < alpha_sz; j++) {
      go(i, j);
    }
  }
}
void ord_dfs(int node, int p) {
  l[node] = ++dfs_co;
  for (int a : leaf_adj[node]) {
    if (a != p) {
      ord_dfs(a, node);
    }
  }
  r[node] = dfs_co;
}
int bit_qry(int node) {
  int tot = 0;
  while (node > 0) {
    tot += bit[node];
    node -= node & -node;
  }
  return tot;
}
void bit_update(int node, int val) {
  while (node <= dfs_co) {
    bit[node] += val;
    node += node & -node;
  }
}
void songs_dfs(int node, int state) {
  song_node &sn = song_nodes[node];
  for (int ind : sn.qry_inds) {
    int qry_node = qry_to_node[ind];
    ans[ind] = bit_qry(r[qry_node]) - bit_qry(l[qry_node] - 1);
  }
  for (pair<int, int> &chld : sn.chldrn) {
    int nstate = qry_nodes[state].go[chld.second];
    int last_qry = qry_nodes[nstate].last_qry;
    bit_update(l[last_qry], 1);
    songs_dfs(chld.first, nstate);
    bit_update(l[last_qry], -1);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int t;
    char c[2];
    scanf("%d", &t);
    if (t == 1) {
      scanf("%s", c);
      song_nodes[0].chldrn.push_back({i, c[0] - 'a'});
    } else {
      int j;
      scanf("%d%s", &j, c);
      song_nodes[j].chldrn.push_back({i, c[0] - 'a'});
    }
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    int j;
    scanf("%d%s", &j, qry_txt);
    song_nodes[j].qry_inds.push_back(i);
    add_qry_txt(qry_txt, i);
  }
  calc_links();
  ord_dfs(0, -1);
  songs_dfs(0, 0);
  for (int i = 1; i <= m; i++) {
    printf("%d\n", ans[i]);
  }
  return 0;
}
