#include <cstdio>
#include <algorithm>
#include <vector>
#define INF 1000000000
#define MAXN 50001
using namespace std;
vector <pair <int,int> >v[MAXN];
int cit[MAXN],dist[MAXN],heap[MAXN],poz[MAXN],k,n,m;
inline void up(int p)
{
    int x;
    while((x=p>>1) && dist[heap[p]]<dist[heap[x]])
    {
        swap(poz[heap[x]],poz[heap[p]]);
        swap(heap[x],heap[p]);
        p=x;
    }
}
inline void down(int p)
{
    int x,minim;
    bool ok=true;
    while((x=p<<1)<=k && ok)
    {
        ok=false;
        if(x<k && dist[heap[x+1]]<dist[heap[x]])
            minim=x+1;
        else
            minim=x;
        if(dist[heap[minim]]<dist[heap[p]])
        {
            swap(poz[heap[minim]],poz[heap[p]]);
            swap(heap[minim],heap[p]);
            p=minim;ok=true;
        }
    }
}
inline bool Dijkstra(int s)
{
    int x,y,c;
    for(int i=1;i<=n;i++)
        dist[i]=INF;
    poz[s]=k=1;
    heap[1]=s;dist[s]=0;
    while(k)
    {
        x=heap[1];
        swap(poz[heap[1]],poz[heap[k]]);
        swap(heap[1],heap[k]);
        k--;down(1);
        for(unsigned int i=0;i<v[x].size();i++)
        {
            y=v[x][i].first;c=v[x][i].second;
            if(dist[y]>dist[x]+c)
            {
                dist[y]=dist[x]+c;
                if(poz[y])
                    up(poz[y]);
                else
                {
                    poz[y]=++k;heap[k]=y;
                    up(k);
                }
            }
        }
    }
    for(int i=1;i<=n;i++)
        if(dist[i]!=cit[i])
            return false;
    return true;
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("distante.in","r");
    fout=fopen("distante.out","w");
    int t,s,x,y,c;
    fscanf(fin,"%d",&t);
    for(int i=0;i<t;i++)
    {
        fscanf(fin,"%d%d%d",&n,&m,&s);
        for(int i=1;i<=n;i++)
            fscanf(fin,"%d",&cit[i]);
        for(int i=0;i<m;i++)
        {
            fscanf(fin,"%d%d%d",&x,&y,&c);
            v[x].push_back(make_pair(y,c));
            v[y].push_back(make_pair(x,c));
        }
        if(Dijkstra(s))
            fprintf(fout,"DA\n");
        else
            fprintf(fout,"NU\n");
        for(int i=1;i<=n;i++)
            v[i].clear();
    }
    fclose(fin);
    fclose(fout);
    return 0;
}