#include <fstream>
#include <queue>
#include <vector>
#include <utility>

#define inf 1e9

using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");

int n,m,sursa,T;

priority_queue< pair<int,int> , vector<pair<int,int> >,greater<pair<int,int> > >h;
vector<pair<int,int> > v[50001];

int d[50001],verif[50001];

bool viz[50001];

int main()
{
    f>>T;

    for(int qw=1;qw<=T;++qw){

    f>>n>>m>>sursa;

     for(int i=1;i<=n;++i)
        {
            d[i]=inf;viz[i]=false;
            v[i].clear();
        }

    for(int i=1;i<=n;++i)
        f>>verif[i];

    for(int i=1;i<=m;++i)
    {
        int a,b,c;
        f>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
        v[b].push_back(make_pair(c,a));

    }

    h.push(make_pair(0,sursa));
    d[sursa]=0;

    while(!h.empty())
    {

        int nod = h.top().second;
        h.pop();
        if(!viz[nod])
        {

            viz[nod]=true;
            for(int i=0;i<v[nod].size();++i)
            {

                if(d[nod]+v[nod][i].first<d[v[nod][i].second])
                    {
                        d[v[nod][i].second]=d[nod]+v[nod][i].first;
                        h.push(make_pair(d[v[nod][i].second],v[nod][i].second));
                    }

            }

        }

    }


    bool ok =true;
    for(int i=1;i<=n&&ok;++i)
        if(verif[i]!=d[i])ok=false;
    if(ok)
        g<<"DA"<<'\n';
    else g<<"NU"<<'\n';


    }
    return 0;
}
//#588 1887 591 pebeinfo