uva 869

Floyd 秒過

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 130
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int n;
int mz[M][M];
int m;
int mz2[M][M];
void solve(){
    for(int k=0;k<M;k++){
        for(int i=0;i<M;i++){
            for(int j=0;j<M;j++){
                if(mz[i][k]&&mz[k][j]){
                    mz[i][j]=1;
                }
                if(mz2[i][k]&&mz2[k][j]){
                    mz2[i][j]=1;
                }
            }
        }
    }
    bool y=true;
    for(int i=0;i<M;i++){
        for(int j=0;j<M;j++){
//            debug("%c %c %d %d\n",i+'A',j+'A',mz[i][j],mz2[i][j]);
            if(mz[i][j]!=mz2[i][j]){
                y=false;break;
            }
        }
        if(!y)break;
    }
    if(y){
        printf("YES\n");
    }else printf("NO\n");
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
//    printf("%d %d\n",'A','z');
    scanf("%d",&test);
    while(test--){
        Set(mz,0);
        Set(mz2,0);
        scanf("%d%*c",&n);
        for(int i=0;i<n;i++){
            char a,b;
            scanf("%c %c%*c",&a,&b);
            a=toupper(a);
            b=toupper(b);
            mz[a-'A'][b-'A']=1;
//            mz[b-'A'][a-'A']=1;
        }
        scanf("%d%*c",&m);
        for(int i=0;i<m;i++){
            char a,b;
            scanf("%c %c%*c",&a,&b);
            a=toupper(a);
            b=toupper(b);
            mz2[a-'A'][b-'A']=1;
//            mz2[b-'A'][a-'A']=1;
        }
        solve();
        if(test)Pln();
    }

















}