#include <fstream>
#include <vector>
#include <set>
#define NMAX 50005
#define INF 16e5
using namespace std;
vector<pair<int,int> > G[NMAX];
vector<pair<int,int> >::iterator it;
set<pair<int,int> > h;
int n,m,i,k,s,t,from,to,cost,ok,dis[NMAX],dist[NMAX];
int main()
{
    ifstream f("distante.in");
    ofstream g("distante.out");
    f>>t;
    for(k=1; k<=t; k++)
    {
        f>>n>>m>>s;
        for(i=1; i<=n; i++)
        {
            f>>dis[i];
            G[i].clear();
            dist[i]=INF;
        }
        for(i=1; i<=m; i++)
        {
            f>>from>>to>>cost;
            G[from].push_back(make_pair(to,cost));
            G[to].push_back(make_pair(from,cost));
        }
        dist[s]=0;
        h.insert(make_pair(0,s));
        int node;
        while(!h.empty())
        {
            node=h.begin()->second;
            h.erase(h.begin());
            for(it=G[node].begin();it!=G[node].end();++it)
            {
                to=it->first;
                cost=it->second;
                if (dist[to]>dist[node]+cost)
                {
                    if (dist[to]!=INF) h.erase(h.find(make_pair(dist[to],to)));
                    dist[to]=dist[node]+cost;
                    h.insert(make_pair(dist[to],to));
                }
            }

        }
        ok=1;
        for (i=1; i<=n; i++)
        if(dist[i]!=dis[i])
        {
            ok=0;
            break;
        }
        if(ok==1) g<<"DA\n";
        else g<<"NU\n";
    }
    f.close(); g.close();
    return 0;
}