#include <iostream>

 #include <cstdio>

 #include <map>

 #include <iomanip>

 #include <string>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int MAXN=;

 const int MAXM=;

 const int inf=;

 int head[MAXN];

 struct e{

     int u,v;

     int depart,arrival;

     int next;

 }edge[MAXM];

 int tot,n,m,limit;

 int start_city,des_city;

 string start,destin;

 int timeh[][];

 void addedge(int u,int v,int de,int ar){

     edge[tot].u=u;

     edge[tot].v=v;

     edge[tot].depart=de;

     edge[tot].arrival=ar;

     edge[tot].next=head[u];

     head[u]=tot++;

 }

 void slove(){

     for(int e=head[start_city];e!=-;e=edge[e].next){

         if(edge[e].depart>=limit){

             timeh[edge[e].v][edge[e].arrival]=edge[e].depart;

         }

     }

     for(int i=;i<=;i++){

         for(int j=;j<=n;j++){

             if(timeh[j][i]!=-){

                 for(int e=head[j];e!=-;e=edge[e].next){

                     if(i<=edge[e].depart){

                         timeh[edge[e].v][edge[e].arrival]=max(timeh[edge[e].v][edge[e].arrival],timeh[j][i]);

                     }

                 }

             }

         }

     }

     for(int i=;i<=;i++){

         if(timeh[des_city][i]!=-){

             cout << "Departure " << setw() << setfill('');

             cout << timeh[des_city][i] << " " << start << endl;

             cout << "Arrival   " << setw() << setfill('');

             cout << i << " " << destin << endl;

             return ;

         }

     }

     cout << "No connection" << endl;

 }

 int main(){

     string station,pre,cur;

     int cas=;int T,pretime,curtime,u,v,train;

     scanf("%d",&T);

     while(T--){

         cas++; tot=;

         memset(head,-,sizeof(head));

         memset(timeh,-,sizeof(timeh));

         map<string,int>city;

         scanf("%d",&n);

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

             cin>>station;

             city[station]=i;

         }

         scanf("%d",&train);

         while(train--){

             scanf("%d",&m);

             for(int i=;i<=m;i++){

                 cin>>curtime>>cur;

                 if(i>){

                     u=city[pre];

                     v=city[cur];

                     addedge(u,v,pretime,curtime);

                 }

                 pre=cur;

                 pretime=curtime;

             }

         }

         cin>>limit>>start>>destin;

         start_city=city[start]; des_city=city[destin];

          cout << "Scenario " << cas << endl;

         slove();

         cout << endl;

     }

     return ;

 }