#include <bits/stdc++.h>

using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
const int nmax = 50005;
int n, m, g, s, d[nmax];
int main()
{
    fin >> g;
    for(int t = 1; t <= g; ++t)
    {
        fin >> n >> m >> s;
        bool ok = true;
        for(int i = 1; i <= n; ++i)
        {
            fin >> d[i];
        }
        for(int i = 1; i <= m; ++i)
        {
            int x, y, c;
            fin >> x >> y >> c;
            if((d[y] != c && x == s) || (d[x] != c && y == s))
            {
                ok = false;
                break;
            }
        }
        if(ok)
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}