#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("distante.in"); ofstream g("distante.out");
const int INF=(1LL<<30)-1;
int t,n,m,s,d[50001],dist[50001],viz[50001],x,y,z;
vector <pair<int,int> > edge[50001];
struct cmp
{   bool operator()(int x,int y)
    {   return dist[x]>dist[y]; }
};
priority_queue<int,vector<int>,cmp> q;
bool dijkstra()
{   for(int i=1;i<=n;i++)
    {   dist[i]=INF;
        viz[s]=0;
    }
    dist[s]=0; q.push(s);
    viz[s]=1;
    while(!q.empty())
    {   int aux=q.top();
        q.pop();
        viz[aux]=0;
        for(size_t i=0;i<edge[aux].size();i++)
        {   if(dist[aux]+edge[aux][i].second<dist[edge[aux][i].first])
            {   dist[edge[aux][i].first]=dist[aux]+edge[aux][i].second;
                if(!viz[edge[aux][i].first])
                {   viz[edge[aux][i].first]=1;
                    q.push(edge[aux][i].first);
                }
            }
        }
    }
    for(int i=1;i<=n;i++)
        if(dist[i]!=d[i]) return false;
    return true;
}
int main()
{   f>>t;
    while(t--)
    {   f>>n>>m>>s;
        for(int i=1;i<=n;i++)
        {   f>>d[i];
            edge[i].clear();
        }
        for(int i=1;i<=m;i++)
        {   f>>z>>y>>z;
            edge[x].push_back(make_pair(y,z));
            edge[y].push_back(make_pair(x,z));
        }
        if(dijkstra()) g<<"DA"<<'\n';
        else g<<"NU"<<'\n';
    }
    g.close(); return 0;
}