/****************************************************

     Author:Coolxxx

     Copyright 2017 by Coolxxx. All rights reserved.

     CSDN:http://blog.csdn.net/u010568270

 ****************************************************/

 #include<bits/stdc++.h>

 #pragma comment(linker,"/STACK:1024000000,1024000000")

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define mem(a,b) memset(a,b,sizeof(a))

 #define eps (1e-8)

 #define J 10000

 #define mod 1000000007

 #define MAX 0x7f7f7f7f

 #define PI 3.14159265358979323

 #define N 104

 #define M 10004

 using namespace std;

 typedef long long LL;

 double anss;

 LL aans;

 int cas,cass;

 int n,m,lll,ans;

 int R,U,Q;

 string ch,name;

 struct category

 {

     string name;

     int level;

 }ca[N],p;

 struct role

 {

     int num;

     string name;

     category rc[N];

 }ro[N];

 map<string,int>r;

 struct user

 {

     int num;

     string name;

     map<string,int>c;

 }us[N];

 void change(string ch,category &aa)

 {

     if(ch[ch.size()-]==':')

     {

         aa.name=ch.substr(,ch.size()-);

         aa.level=ch[ch.size()-]-'';

     }

     else

     {

         aa.name=ch;

         aa.level=-;

     }

 }

 int main()

 {

     #ifndef ONLINE_JUDGE

     freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j,k,l;

     int x,y,z;

 //    for(scanf("%d",&cass);cass;cass--)

 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)

 //    while(~scanf("%s",s))

     while(~scanf("%d",&n))

     {

         for(i=;i<=n;i++)

         {

             cin>>ch;

             change(ch,ca[i]);

         }

         scanf("%d",&R);

         for(i=;i<=R;i++)

         {

             cin>>ro[i].name>>ro[i].num;

             r[ro[i].name]=i;

             for(j=;j<=ro[i].num;j++)

             {

                 cin>>ch;

                 change(ch,ro[i].rc[j]);

             }

         }

         scanf("%d",&U);

         for(i=;i<=U;i++)

         {

             cin>>us[i].name>>x;

             for(j=;j<=x;j++)

             {

                 cin>>ch;

                 k=r[ch];

                 for(l=;l<=ro[k].num;l++)

                 {

                     if(us[i].c.find(ro[k].rc[l].name)==us[i].c.end())

                         us[i].c[ro[k].rc[l].name]=ro[k].rc[l].level;

                     else us[i].c[ro[k].rc[l].name]=max(us[i].c[ro[k].rc[l].name],ro[k].rc[l].level);

                 }

             }

         }

         scanf("%d",&Q);

         for(i=;i<=Q;i++)

         {

             cin>>name>>ch;

             change(ch,p);

             for(j=;j<=U;j++)

                 if(us[j].name==name)

                     break;

             if(j>U)

             {

                 puts("false");

                 continue;

             }

             if(us[j].c.find(p.name)!=us[j].c.end())

             {

                 if(p.level==- && us[j].c[p.name]!=-)

                     cout<<us[j].c[p.name]<<endl;

                 else if(us[j].c[p.name]>=p.level)

                     puts("true");

                 else puts("false");

             }

             else puts("false");

         }

     }

     return ;

 }

 /*

 //

 //

 */