#include <cstdio>
#include <algorithm>
#include<vector>
#include<queue>

using namespace std;

int t,nod,minim,i,aux,n,k,j,p,s,unu,m,doi,x,st,dr,maxi,sol,maxi2,viz[50010],y,conex,cost,d[50010],ok;
int start;
vector < pair<int, int> > v[50010];

struct cmp
{
    bool operator() (int x,int y)
    {
        return d[x]>d[y];
    }
};

priority_queue<int,vector <int>,cmp> q;




int main()
{
    freopen ("distante.in","r",stdin);
    freopen ("distante.out","w",stdout);
    scanf("%d",&t);
    for(p=1;p<=t;p++)
    {

    scanf("%d%d%d",&n,&m,&start);

    for(i=1;i<=n;i++)
    {
        scanf("%d",&viz[i]);
        d[i]=100000000;
    }
    q.push(start);
    d[start]=0;
    for(i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&cost);
       // printf("%d %d %d\n",x,y,cost);
        v[x].push_back(make_pair(y,cost));
         v[y].push_back(make_pair(x,cost));
    }

    while(! q.empty())
    {
        nod=q.top();
        q.pop();
       // printf("%d\n",nod);

        for(i=0;i<v[nod].size();i++)
        {
        //printf("%d %d\n",nod,v[nod][i].first);
            if(d[v[nod][i].first] > d[nod]+v[nod][i].second)
            {
                //printf("%d %d\n",nod,v[nod][i].first);
                d[v[nod][i].first] = d[nod]+v[nod][i].second;
                q.push(v[nod][i].first);
            }

        }
    }
    ok=1;
    for(i=1;i<=n;i++)
    {
        if(viz[i]!=d[i])
        ok=0;
    }
    if(ok==1)
    printf("DA\n",ok);
    else
    {
        printf("NU\n");
    }
    for(i=1;i<=n;i++)
    {
    v[i].resize(0);
    }
    /*for(i=1;i<=n;i++)
    {
        for(j=1;j<=)
    }*/
    }
}