#include <bits/stdc++.h>
#define INF 2000000000

using namespace std;

struct muchie{
    int nod,cost;
};

int n,m,S,T;
int d[50003],sol[50003];
queue<int>q;
vector<muchie>L[50003];

ifstream fin("distante.in");
ofstream fout("distante.out");

void Citire()
{
    int i,x,y,c;
    muchie w;
    fin>>n>>m>>S;
    for(i=1;i<=n;++i)
        fin>>d[i];
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>c;
        w.nod=y;
        w.cost=c;
        L[x].push_back(w);
        w.nod=x;
        L[y].push_back(w);
    }
}

void Reinit()
{
    int i;
    for(i=1;i<=n;++i)
    {
        sol[i]=INF;
        L[i].clear();
    }
}

void BFS()
{
    int x,y,c;
    unsigned int j;
    sol[S]=0;
    q.push(S);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(j=0;j<L[x].size();++j)
        {
            y=L[x][j].nod;
            c=L[x][j].cost;
            if(sol[y]>sol[x] + c)
            {
                sol[y]=sol[x] + c;
                q.push(y);
            }
        }
    }
}

void Afisare()
{
    int i;
    for(i=1;i<=n;++i)
        if(d[i]!=sol[i])
        {
            fout<<"NU\n";
            return;
        }
    fout<<"DA\n";
}

int main()
{
    int i;
    fin>>T;
    while(T--)
    {
        for(i=1;i<=n;++i)
            L[i].clear();
        Citire();
        for(i=1;i<=n;++i)
            sol[i]=INF;
        BFS();
        Afisare();
    }
    return 0;
}