#include <bits/stdc++.h>

using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
const int nmax = 2505;
const int oo = (1 << 30);

int n, m, g, s, d1[nmax], d[nmax][nmax];
int main()
{
    fin >> g;
    for(int t = 1; t <= g; ++t)
    {
        fin >> n >> m >> s;
        for(int i = 1; i <= n; ++i)
            fin >> d1[i];
        for(int i = 1; i <= m; ++i)
        {
            int x, y, c;
            fin >> x >> y >> c;
            if(x == s)
            {
                d[x][y] = c;
                d[y][x] = c;
            }
            else if(d[s][x] > 0 && ((d[s][y] == 0) || (d[s][y] > d[s][x])))
            {
                d[s][y] = c;
                d[y][s] = c;
            }

        }
        bool ok = true;
        d[s][s] = 0;
        if(d1[s] != 0)
        {
            ok = false;
        }
        else
        {
        for(int i = 1; i <= n; ++i)
        {
            if(d1[i] != d[s][i])
            {
                ok = false;
                break;
            }
        }
        }
        if(ok)
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}