#include <bits/stdc++.h>
#define N 55010
#define INF 200000001

using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");

vector<pair<int,int> > vec[N];
int dist[N],i,j,n,m,k,t,s,p,r,disi[N],ok=1;
set<pair<int,int> > h;

int main()
{
    int from,to,cost;
    f>>t;
    while(t!=0)
    {
        f>>n>>m>>s;
        for(i=1;i<=n;i++){
            f>>disi[i];
            vec[i].clear();
            dist[i]=INF;
        }
        while(m!=0)
        {
            f>>from>>to>>cost;
            vec[from].push_back(make_pair(to,cost));
            vec[to].push_back(make_pair(from,cost));
            m--;
        }
        dist[s]=0;
        h.insert(make_pair(0,s));
        int nod;
        while(!h.empty())
        {
            nod=h.begin()->second;
            h.erase(h.begin());
            for(vector<pair<int,int> >::iterator it=vec[nod].begin();it!=vec[nod].end();it++)
            {
                to=it->first;
                cost=it->second;
                if(dist[to]>dist[nod]+cost)
                {
                    if(dist[to]!=INF)
                        h.erase(h.find(make_pair(dist[to],to)));
                    dist[to]=dist[nod]+cost;
                    h.insert(make_pair(dist[to],to));
                }
            }
        }
        ok=1;
        for(i=1;i<=n;i++)
            if(disi[i]!=dist[i])
            {
                ok=0;
                break;
            }
        if(ok==1)
            g<<"DA"<<"\n";
        else
            g<<"NU"<<"\n";
        t--;
    }
}