#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define si(x) (int)(x.size())

#define tct template<class t>
#define tctu template<class t, class u>

tct using vc=vector<t>;
using vi=vc<int>;
tctu bool chmax(t&a, u b){ if(a<b){a=b;return 1;}return 0;}
tctu bool chmin(t&a, u b){ if(a>b){a=b;return 1;}return 0;}
#define a first
#define b second

struct Aho{
	struct N{
		map<char,int>nx;
		int fail;
		N():fail(-1){}
	};
	vc<N>x;
	vi idx,pos;
	vc<vi>edge;
	vi sum;
	Aho():x(1){}
	void make(int up){
		idx.pb(0);
		int h=0;
		while(h<si(idx)){
			int i=idx[h++];
			for(auto e:x[i].nx){
				int j=e.b,f=x[i].fail;
				while(f!=-1 and x[f].nx.count(e.a)==0)
					f=x[f].fail;
				if(f != -1)
					x[j].fail=x[f].nx[e.a];
				else
					x[j].fail=0;
				idx.pb(j);
			}
		}
		edge.resize(si(idx));
		sum.resize(si(idx));
		rep(i,up)sum[i]++;
		rep(i,si(idx)){
			if(x[i].fail < 0) continue;
			edge[x[i].fail].pb(i);
		}
		auto dfs=[&](auto self,int v)->void{
			for(auto to:edge[v]){
				self(self,to);
				sum[v]+=sum[to];
			}
		};
		dfs(dfs,0);
	}
	N& operator[](int i){return x[i];}
};

void solve(){
	int n,k;cin>>n>>k;
	Aho ah;
	rng(i,1,n+1){
		string s; int p;
		cin>>s>>p;
		if(ah.x[p].nx.count(s[0]) == 0){
			ah.x[p].nx[s[0]]=si(ah.x);
			ah.x.eb();
		}
	}
	vc<string>v(k);
	vi id(k);
	rep(i,k){
		cin>>v[i];
		reverse(all(v[i]));
		int cur = 0;
		rep(j,si(v[i])){
			if(ah.x[cur].nx.count(v[i][j])==0){
				ah.x[cur].nx[v[i][j]]=si(ah.x);
				ah.x.eb();
			}
			cur = ah.x[cur].nx[v[i][j]];
		}
		id[i] = cur;
	}
	ah.make(n+1);
	rep(i,k)cout<<ah.sum[id[i]]<<'\n';
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	solve();
}