#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>
#define IN "distante.in"
#define OUT "distante.out"
#define NMAX 50005
//#define INF INT_MAX

using namespace std;

ifstream in(IN);
ofstream out(OUT);

int n, m, s, dmin[NMAX], dmin2[NMAX];

vector < pair<int, int> > G[NMAX];

queue <int> Q;

bool InQueue[NMAX];

inline bool BellmanFord()
{
    int nod, i;
    for(i=1; i<=n; ++i)
    {
        dmin2[i]=INT_MAX;
        InQueue[i]=false;
    }
    Q.push(s);
    InQueue[s]=true;
    dmin2[s]=0;
    while(!Q.empty())
    {
        nod=Q.front();
        Q.pop();
        InQueue[nod]=false;
        for(i=0; i<G[nod].size(); ++i)
        if(dmin2[nod] + G[nod][i].second < dmin2[G[nod][i].first])
        {
            dmin2[G[nod][i].first] = dmin2[nod] + G[nod][i].second;
            if(!InQueue[G[nod][i].first])
            {
                Q.push(G[nod][i].first);
                InQueue[G[nod][i].first]=true;
            }
        }
    }
    for(i=1; i<=n; ++i)
        if(dmin2[i] != dmin[i])
            return false;
    return true;
}

int main()
{
    int T, a, b, c, i;
    in>>T;
    while(T--)
    {
        in>>n>>m>>s;
        for(i=1; i<=n; ++i)
            in>>dmin[i];
        for(i=1; i<=m; ++i)
        {
            in>>a>>b>>c;
            G[a].push_back(make_pair(b,c));
            G[b].push_back(make_pair(a,c));
        }
        if(!BellmanFord())
            out<<"NU\n";
        else out<<"DA\n";
        for(i=1; i<=n; ++i)
         //       G[i].erase(G[i].begin()+n);
         G[i].clear();
    }
    in.close();
    out.close();
    return 0;
}