/* Distante, problema Bellman-Ford */
#include<fstream>
#include<queue>
#include<vector>
using namespace std;

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

int n,m,i,s,dist[50001],distcomp[50001],gasit;
struct muchie{int nod; int cost;};
vector<muchie> v[50001];
int zz;
void bellman_ford(int origin)
{queue <int> q;
 int destination,cost_link;
 q.push(origin);
 while(!q.empty())
 {origin=q.front();
  q.pop(); 
  for(i=0; i<v[origin].size(); i++)
    {destination=v[origin][i].nod;
     cost_link=v[origin][i].cost;
     if(destination!=s && (dist[destination]==0 || dist[destination]>dist[origin]+cost_link))
        {dist[destination]=dist[origin]+cost_link;
         zz=dist[destination];
         q.push(destination);}
     }
      
  }
}

int t,k;

int main()
{f>>t;
    
for(k=1; k<=t; k++)    
{f>>n>>m>>s;
int a,b,c;
muchie x,y;
for(i=1; i<=n; i++)
  {f>>distcomp[i];
   v[i].clear();
   dist[i]=0;}
for(i=1; i<=m; i++)
{f>>a>>b>>c;
x.nod=b;  x.cost=c;    
y.nod=a;  y.cost=c;
v[b].push_back(y);
v[a].push_back(x);
}

bellman_ford(s);

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