#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include <utility>
#include <map>
#define N 100   //顶点个数
#define INF 0x3f3f3f3f
using namespace std;
int n;
char s1[110],s2[110];
int ok()
{
    for(int i = 0; i < n; i++)
    {
        if(s1[i] == 'A' && s2[i] != 'U')
            return 0;
        if(s1[i] == 'T' && s2[i] != 'A')
            return 0;
        if(s1[i] == 'C' && s2[i] != 'G')
            return 0;
        if(s1[i] == 'G' && s2[i] != 'C')
            return 0;
    }
    return 1;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        scanf("%s%s",s1,s2);
        if(ok())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}