#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N=3e5+3;
vector<int>g[N];
char s[30];
bool us[N];
int t=0;
pair<int, int> T[N];
map<int, vector<pair<string, string>>>a;
map<string, vector<pair<int, string>>>b;
void dfs(int x){
    
    t++;
    T[x].first=t;
    us[x]=true;
    for (int i=0; i<a[x].size(); i++){
        b[a[x][i].first].push_back({t, a[x][i].second});
    }
    for (int i=0; i<g[x].size(); i++){
        int y=g[x][i];
        if (!us[y]){
            dfs(y);
            for (int ii=0; ii<a[y].size(); ii++){
                string z1=a[y][ii].first;
                int t1=T[x].first;
                int l=0;
                int r=b[z1].size()-1;
                while(true){
                    if (r-l<=1){
                        int m=l;
                        if (b[z1][m].first<=t1){
                            l=m;
                        }
                        m=r;
                        if (b[z1][m].first<=t1){
                            l=m;
                        }
                        break;
                    }
                    int m=(l+r)/2;
                    if (b[z1][m].first<=t1){
                        l=m;
                    }
                    else {
                        r=m;
                    }
                }
               /* if (z1=="enabled"){
                    cout<<x<<" "<<y<<" "<<t1<<" "<<l<<endl;
                }*/
                b[z1].push_back({T[y].second, b[z1][l].second});
            }
            
        }
    }
    t++;
    T[x].second=t;
    
}
int main()
{
    int n;
	scanf("%d", &n);
	int root;
	set<string>ss;
	for (int i=0; i<n; i++){
	    int x, y;
	    scanf("%d %d", &x, &y);
	    while(y--){
	        scanf("%s", &s);
	        int sz=strlen(s);
    	    string z1, z2;
    	    int ind=0;
    	    for (int j=0; j<sz; j++){
    	        if (s[j]=='='){
    	            ind=j;
    	            break;
    	        }
    	        z1+=s[j];
    	    }
    	    for (int j=ind+1; j<sz; j++){
    	        
    	        z2+=s[j];
    	    }
    	    ss.insert(z1);
    	    a[i+1].push_back({z1, z2});   
	    }
	    if (x)
	        g[x].push_back(i+1);
	    else 
	        root=i+1;
	}
    for (auto i:ss){
        b[i].push_back({0, "N/A"});
    }
	dfs(root);
/*	for (auto i:b){
	    cout<<i.first<<endl;
	    for (int j=0; j<i.second.size(); j++){
	        cout<<i.second[j].first<<" "<<i.second[j].second<<endl;
	    }
	    cout<<endl;
	}
*/	
    int m;
    scanf("%d", &m);
    while(m--){
        int x;
        scanf("%d %s", &x, &s);
        if (ss.find(s)==ss.end()){
            cout<<"N/A"<<endl;
            fflush(stdout);
            continue;
        }
        int t1=T[x].first;
        int l=0;
        int r=b[s].size()-1;
        while(true){
            if (r-l<=1){
                int mid=l;
                if (b[s][mid].first<=t1){
                    l=mid;
                }
                mid=r;
                if (b[s][mid].first<=t1){
                    l=mid;
                }
                break;
            }
            int mid=(l+r)/2;
            if (b[s][mid].first<=t1){
                l=mid;
            }
            else {
                r=mid;
            }
        }
        cout<<b[s][l].second<<endl;
        fflush(stdout);
            
    }
  /*  for (int i=0; i<b["enabled"].size(); i++){
        cout<<b["enabled"][i].first<<" "<<b["enabled"][i].second<<endl;
    }*/
	return 0;
}