//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
int n,m,p,s;
const int Max =50005;
vector < pair < int ,int > >v[Max];
set < pair < int , int > >c;
bool t[Max];
int d1[Max],d2[Max];
bool ok;
void Dijkstra()
{
    while(!c.empty())
    {
        int nod=c.begin()->second;
        c.erase(c.begin());
        t[nod]=1;
     for(int i=0;i<v[nod].size();i++)
     {
         int vecin=v[nod][i].first;
         int dist=v[nod][i].second;
         if( t[vecin]==0 && d2[vecin]>d2[nod]+dist)
         {
             if(d2[vecin]!=INT_MAX)
             c.erase({d2[vecin],vecin});
             d2[vecin]=d2[nod]+dist;
                c.insert({d2[vecin],vecin});

         }
     }
    }
      ok=1;
    for(int i=1;i<=n;i++)
    {
         t[i]=0;
        if(d1[i]!=d2[i])
            ok=0;
    }

             if(ok)
                out<<"DA"<<"\n";
            else
                out<<"NU"<<"\n";

}
void citire()
{
    in>>p;
    for(int i=0;i<p;i++)
    {
         in>>n>>m>>s;
        for(int j=1;j<=n;j++)
         {
             int x;
             in>>x;
             d1[j]=x;
         }

    for(int j=0;j<m;j++)
    {
         int x,y,z;
         in>>x>>y>>z;
         v[x].push_back(make_pair(y,z));
         v[y].push_back(make_pair(x,z));
    }
  for(int i=1;i<=n;i++)
    d2[i]=INT_MAX;
    d2[s]=0;
    c.insert({0,s});
    Dijkstra();
    for(int i=1;i<=n;i++)
    v[i].clear();
    }


}

void afisare()
{
    for(int i=1;i<=n;i++)
        if(d2[i]!=INT_MAX)
        out<<d2[i]<<" ";
    else
        out<<0<<" ";
}
int main()
{
    citire();
    return 0;
}