#include <vector>
#include <fstream>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;
const int NMAX=50002;
int n, a, b, c, tests, i, ok, k, sp, verif[NMAX];
vector< pair<int,int> > g[NMAX];
int main()
{
    ifstream in("distante.in");
    ofstream out("distante.out");
    in>>tests;
    while(tests--)
    {
        in>>n>>k>>sp;
        for(i=1; i<=n; i++)
        {
            in>>verif[i];
            g[i].clear();
        }
        for(i=1; i<=k; i++)
        {
            in>>a>>b>>c;
            g[a].push_back(make_pair(b,c));
        }
        ok=1;
        if(verif[sp]!=0)
        {
            ok=0;
            out<<"NU\n";
        }
        else
        {
            if(ok)
            {
                for(i=1; i<=n&&ok; i++)
                    for(vector< pair<int,int> >::iterator it=g[i].begin(); it!=g[i].end()&&ok; it++)
                        if(verif[it->first]+it->second<verif[i]||verif[i]+it->second<verif[it->first])
                            ok=0;
            }
            if(!ok)out<<"NU\n";
            else
                out<<"DA\n";
        }

    }
    return 0;
}