#include <bits/stdc++.h>
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
#define N 50001
int t,k,n,m,i,source,x,y,c,vecin,cost,d[N],dist[N];
bitset <N> viz;
struct compare
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};

priority_queue <int, vector<int>, compare> pQ;
vector< pair<int,int> >G[N];

int main()
{
    in>>t;
    for(k=1; k<=t; k++)
    {
        in>>n>>m>>source;
        for(i=1; i<=n; i++)
        {
            in>>dist[i];
            viz[i]=0;
            d[i]=2147483647;
        }
        for(i=1; i<=m; i++)
        {
            in>>x>>y>>c;
            G[x].push_back(make_pair(y,c));
            G[y].push_back(make_pair(x,c));
        }
        viz[source]=1;
        d[source]=0;
        pQ.push(source);
        while(!pQ.empty())
        {
            x=pQ.top();
            for(i=0; i<G[x].size(); i++)
            {
                vecin=G[x][i].first;
                cost=G[x][i].second;
                if(d[x]+cost<d[vecin])
                {
                    d[vecin]=d[x]+cost;
                    if(!viz[vecin])
                    {
                        pQ.push(vecin);
                        viz[vecin]=1;
                    }
                }
            }
            viz[x]=0;
            pQ.pop();
        }
        int ok=1;
        for(i=1; i<=n && ok; i++)
            if(d[i]!=dist[i]) ok=0;
        if(ok==0) out<<"NU\n";
        else out<<"DA\n";
    }
}