#include <bits/stdc++.h>

using namespace std;
ifstream fin ("distante.in");
ofstream fout ("distante.out");
const int NMAX=5*1e4+5,INF=0xf3f3f3;
int n,m,T,D[NMAX],S;
bool verif(int dist[])
{
    for(int i=1;i<=n;i++)
        if(dist[i]!=D[i]) return false;
    return true;
}
void dijkstra(bool viz[],int dist[],vector< pair<int,int> > G[])
{
    priority_queue< pair<int,int> > pq;
    pq.push({0,S});
    dist[S]=0;
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        if(viz[nod])continue;
        viz[nod]=true;
        for(int i=0;i<G[nod].size();i++)
        {
            int nods=G[nod][i].second;
            int cost=G[nod][i].first;
            if(dist[nods]>dist[nod]+cost)
            {
               dist[nods]=dist[nod]+cost;
               pq.push({-dist[nods],nods});
            }
        }
    }
    if(verif(dist)) fout<<"DA\n";
    else            fout<<"NU\n";
}
void citire()
{
    int a,b,c;
    int dist[NMAX];
    bool viz[NMAX]={0};
    vector< pair<int,int> > G[NMAX];
    fin>>n>>m>>S;
    for(int i=1;i<=n;i++) fin>>D[i];
    while(m--)
    {
        fin>>a>>b>>c;
        G[a].push_back({c,b});
        G[b].push_back({c,a});
    }
    for(int i=1;i<=n;i++) dist[i]=INF;
    dijkstra(viz,dist,G);
}
int main()
{
    fin>>T;
    while(T--)
    {
        citire();
    }
    return 0;
}