#include<iostream>
#include<queue>
#include<fstream>
#include<vector>
#include<cstring>
#define inf 0x3f3f3f3f

using namespace std;
int n,m,d[36001];
queue <int> q;
bool viz[36001];
//long long c[5000][5000];
vector <pair<int,int> >g[36001];


void dijkstra(int x)
{
    int k;
    q.push(x);
    d[x]=0;
    viz[x]=1;
    while(!q.empty())
    {
        k=q.front();
        vector <pair<int,int> >::iterator i;
        viz[k]=0;
        q.pop();
        for(i=g[k].begin();i!=g[k].end();++i)
        {
            if(d[i->first]>d[k]+i->second)
            {
                d[i->first]=d[k]+i->second;
                if(viz[i->first]==0)
                {
                    viz[i->first]=1;
                    q.push(i->first);
                }
            }
        }
    }

}
int main()
{
    ifstream fin("distante.in");
    ofstream fout("distante.out");
    int i,a,b,j,c,t,dm[36001],ok,s;
    fin>>t;
    while(t!=0)
    {
        --t;
        ok=1;
        memset(d,inf,sizeof(d));
        fin>>n>>m>>s;
        for(i=1;i<=n;++i)
            fin>>dm[i];
        if(dm[s]!=0)   ok=0;
        for(i=1;i<=m;++i)
        {
            fin>>a>>b>>c;
            g[a].push_back(make_pair(b,c));
            g[b].push_back(make_pair(a,c));
        }
        dijkstra(s);
        for(i=1;i<=n;++i)
            if(d[i]!=dm[i])
            {
                ok=0;
                break;
            }
        memset(g,0,sizeof(g));
        if(ok==0)
            fout<<"NU"<<"\n";
        else    fout<<"DA"<<"\n";
    }

    return 0;
}