#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int T,k,i,j,n,m,S,aux,D[50005],c,d[50005],x,y,g[50005],ok;
struct muchie{int nod,val;
             }p;
vector <muchie>v[50005];
queue <int>C;
int main()
{fin>>T;
 for(k=1;k<=T;k++)
    {fin>>n>>m>>S;
     for(i=1;i<=n;i++)
        {fin>>D[i];
         d[i]=1000000000;
        }
        d[S]=0;
     for(i=1;i<=m;i++)
        {fin>>x>>p.nod>>p.val;
         g[x]++;
         g[p.nod]++;
         v[x].push_back(p);
         aux=x;
         x=p.nod;
         p.nod=aux;
         v[x].push_back(p);
        }
        C.push(S);
     while(C.size()>0)
        {c=C.front();
         C.pop();
         for(i=0;i<g[c];i++)
            {if(d[v[c][i].nod]>d[c]+v[c][i].val){d[v[c][i].nod]=d[c]+v[c][i].val;
                                                 C.push(v[c][i].nod);
                                                }
            }
        }
        ok=0;
     for(i=1;i<=n;i++)
        if(d[i]!=D[i]){ok=1;break;}
     if(ok==0)fout<<"DA\n";
     else fout<<"NU\n";
    }
}