#include <bits/stdc++.h>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
vector <pair<int, int> > v[50005];
priority_queue <pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >h;
int d[50005],dcomp[50005],i,j,nr,n,m,x,y,tsk,nd,viz[50005],cost;
bool dijkstra(int nod_st)
{
    d[nod_st]=0;
    h.push(make_pair(0, nod_st));
    int nod;
    while(!h.empty())
    {
        nod=h.top().second;
        h.pop();
        if(viz[nod]==0)
        {
            for(i=0; i<v[nod].size(); i++)
            {
                if(d[nod]+v[nod][i].first<d[ v[nod][i].second ])
                {
                    d[ v[nod][i].second]=d[nod]+v[nod][i].first;
                    h.push(make_pair(d[v[nod][i].second], v[nod][i].second));
                }
            }
        }
        viz[nod]=1;
    }
    for(i=1;i<=n;i++)
    if(d[i]!=dcomp[i])
    return 0;
    return 1;

}
int main()
{
  f>>nr;
  for(tsk=1;tsk<=nr;tsk++)
  {
      f>>n>>m>>nd;
      for(i=1;i<=n;i++)
        f>>dcomp[i];
      for(i=1;i<=m;i++)
      {
          f>>x>>y>>cost;
          v[x].push_back(make_pair(cost,y));
          v[y].push_back(make_pair(cost,x));
      }
    for(i=1; i<=n; i++)
    {
        d[i]=INT_MAX;
        viz[i]=0;
    }
      if(dijkstra(nd))
        g<<"DA"<<endl;
      else
        g<<"NU"<<endl;
    for(i=1;i<=n;i++)
        while(v[i].size())
            v[i].pop_back();
  }
    return 0;
}