#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;

ifstream fin ("distante.in");
ofstream fout ("distante.out");

int main ()
{
  int i,j,cnt,d[50005],T,n,cost,m,s,ok,x,y;

  fin >> T;
  for (cnt=1; cnt <=T; cnt++)
  {
     ok=1;
	 fin >> n >> m >> s; 
     for (i=1; i<=n; i++)
         fin >> d[i];
     if (d[s]!=0) ok=0;
     for (i=1; i<=m; i++)
     {

         fin >> x >> y >> cost;
         if (d[x] + cost < d[y] || d[y] + cost < d[x]) 
             ok=0;
     }
     if (ok==1) fout <<"DA\n";
     else       fout <<"NU\n";
  }

  fin.close();
  fout.close();
  return 0;
}