#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=27;

int ile[N];
int sile[N];
bool is[N][N];
bool odw[N];
int res[N];

int n,m;


void check(vector<int>p)
{
    bool ok=1;
    FOR(i,1,m)
    {
        FOR(j,0,n-1) if(is[p[j]][i]&&is[p[(j+1)%n]][i]&&is[p[(j+2)%n]][i]) ok=0;
    }
    if(ok) cout<<"AC"<<endl;
    else cout<<"WA"<<endl;
}

int main()
{
    int tt;
    cin>>tt;
    while(tt--)
    {
        cin>>n>>m;
        bool ok=1;
        FOR(i,1,m)
        {
            cin>>ile[i];
            sile[i]=ile[i];
            if(ile[i]>2*n/3) ok=0;
            FOR(j,1,ile[i])
            {
                int x;
                cin>>x;
                is[x][i]=1;
            }
        }
        if(ok)
        {
            FOR(k,1,n)
            {
                int ban=0;
                FOR(i,1,m)
                {
                    if(k>=3&&is[res[k-1]][i]&&is[res[k-2]][i]) ban=i;
                }
                debug(ban);
                ll mx=-1,t=-1;
                FOR(i,1,n)
                {
                    if(odw[i]||is[i][ban]) continue;
                    ll act=0;
                    FOR(j,1,m)
                    {
                        if(is[i][j])
                        {
                            if(ile[j]>=3) act=max(act,(ll)ile[j]*N*N+is[res[1]][j]*N+is[res[2]][j]);
                            else act=max(act,(ll)is[res[1]][j]*N+is[res[2]][j]);
                        }
                    }
                    if(act>mx)
                    {
                        t=i;
                        mx=act;
                    }
                }
                res[k]=t;
                debug(k,t);
                odw[t]=1;
                FOR(j,1,m) if(is[t][j]) ile[j]--;
            }
            vector<int>p;
            FOR(i,1,n) p.pb(res[i]);
            check(p);
            debug(p);
        }
        else cout<<-1<<endl;
        FOR(i,1,n)
        {
            odw[i]=0;
            FOR(j,1,m) is[i][j]=0;
        }
    }
    return 0;
}