#include <iostream>
#include <vector>
#include <string>
#include <map>

#define TRUE 3
#define FALSE 2

using namespace std; 
char board[25];
vector<string> words;
map<pair<string,int>, int> cache;

int isPossible(string word, int n, int k){
    if(!word.size()) return TRUE;
    map<pair<string,int>,int>::iterator it = cache.find(pair<string,int>(word,k));
    int ret = it->second;
    if(it != cache.end() && (ret == TRUE || ret == FALSE)) return ret; 
    vector<int> way; 
    if(!n){
        for(int i = 0; i < 25; i++) if(word[0] == board[i]) way.push_back(i);
    } else {
        for(int i = k-6; i < k-3; i++) 
            for(int j = i; j <= i + 10; j = j + 5) 
                if(j != k && j > 0 && j < 25) way.push_back(j);
    }    
    for(int i = 0; i < way.size(); i++) 
        if((word[0] == board[way[i]]) && (isPossible(word.substr(1, word.size()), n+1, way[i]) == TRUE)){
            ret = TRUE;
            cache.insert(pair<pair<string,int>, int>(pair<string,int>(word,k+1), ret));
            return ret; 
        }    
    ret = FALSE;
    cache.insert(pair<pair<string,int>, int>(pair<string,int>(word,k+1), ret));
    return ret; 
}

const char* boggle(string word){
    if(isPossible(word, 0, 0) == TRUE) return "YES";
    else return "NO";
}

int main(){
    int c;
    scanf("%d", &c); 
    while(c--){
        for(int i = 0; i < 5; i++) 
            scanf("%s", &board[i*5]);
        int n;
        scanf("%d", &n); 
        words = vector<string> ();
        while(n--){
            string word;
            cin >> word;
            words.push_back(word);
        }    
        for(int i = 0; i < words.size(); i++) cout << words[i] << " " << boggle(words[i]) << endl;
    }
    return 0;
}