#include <bits/stdc++.h>

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

int n, m, g, s, d1[nmax], d[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[y] = c;
            }
            else
            {
                if(d[y] == 0 && d[x] > 0)
                {
                    d[y] = d[x] + c;
                }
                else if(d[x] > 0)
                    d[y] = min(d[y], d[x] + c);
                else
                    d[y] = d[x] = c;
            }
        }
        d[s] = 0;
        bool ok = true;
        for(int i = 1; i <= n; ++i)
        {
            if(d[i] != d1[i])
            {
                ok = false;
                break;
            }
        }
        if(ok)
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}