#include<stdio.h>
#include<vector>
#include<queue>
#define pb push_back
#define mp make_pair
#define maxn 50005
#define maxb 8192
#define inf 0x3f3f3f3f
using namespace std;

int d[maxn],v[maxn];
vector < pair<int,int> > l[maxn];
char buff[maxb];
int pos=0;

int get_number()
{
    int nr=0;
    while(buff[pos]<'0' || buff[pos]>'9')
     if(++pos==maxb) fread(buff,1,maxb,stdin),pos=0;

    while(buff[pos]>='0' &&  buff[pos]<='9')
    {
        nr=nr*10+buff[pos]-'0';
        if(++pos==maxb) fread(buff,1,maxb,stdin),pos=0;
    }
    return nr;
}

int check()
{
    queue <int> q;
    int n,m,s,k;
    int x,y,c;
    n=get_number(); m=get_number(); s=get_number();
    for(int i=1;i<=n;i++) d[i]=get_number(),v[i]=0,l[i].clear();

    if(d[s]) return 0;
    for(int i=1;i<=m;i++)
    {
        x=get_number(); y=get_number(); c=get_number();
        if(d[x]+c<d[y] || d[y]+c<d[x])
         return 0;
        l[x].pb(mp(y,c));
        l[y].pb(mp(x,c));
    }
    while(!q.empty()) q.pop();
    for(q.push(s),v[s]=1;!q.empty();q.pop())
    {
        k=q.front();
        for(unsigned int i=0;i<l[k].size();i++)
         if(!v[l[k][i].first] && d[k]+l[k][i].second==d[l[k][i].first])
             q.push(l[k][i].first),v[l[k][i].first]=1;
    }
    for(int i=1;i<=n;i++)
     if(!v[i]) return 0;

    return 1;
}

void read()
{
    int t;
    scanf("%d\n",&t);
    for(int i=1;i<=t;i++)
     if(check()) printf("DA\n");
     else printf("NU\n");
}

int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);

    read();
    fclose(stdin);
    fclose(stdout);
    return 0;
}