#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define f first
#define s second
ifstream fin("distante.in");
ofstream fout("distante.out");
vector<pair<int,int> > v[50001];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > h;
int d[50001],sol[50001],n,m,a,b,c,x,i,t,s,ok,j;
bool w[50001];
int main()
{
    fin>>t;
    for(j=1; j<=t; j++)
    {
        fin>>n>>m>>s;
        for(i=1; i<=n; i++)fin>>sol[i];
        for(i=1; i<=m; i++)
        {
            fin>>a>>b>>c;
            v[a].push_back(make_pair(c,b));
            v[b].push_back(make_pair(c,a));
        }

        for(i=1; i<=n; i++)d[i]=1000000001;
        d[s]=0;
        h.push(make_pair(0,s));
        while(!h.empty())
        {
            x=h.top().s;
            h.pop();
            if(!w[x])
            {
                for(i=0; i<v[x].size(); i++)
                {
                    if(d[x]+v[x][i].f<d[v[x][i].s])
                    {
                        d[v[x][i].s]=d[x]+v[x][i].f;
                        h.push(make_pair(d[v[x][i].s],v[x][i].s));
                    }
                }
            }
            w[x]=1;
        }
        for(i=1; i<=n; i++)if(d[i]==1000000001) d[i]=0;
        ok=0;
        for(i=1; i<=n; i++)if(d[i]!=sol[i])
            {
                ok=1;
                break;
            }
        if(ok==1) fout<<"NU";
        else fout<<"DA";
        fout<<'\n';
    }
    return 0;
}