#include <iostream>
#include <queue>
#include <vector>
#include <cstdio>
using namespace std;
int N,M,S,vDist[50005],vDistC[50005];
vector <pair<int,int> > G[50005];
vector <pair<int,int> > ::iterator it;
queue <int> bfq;
void citire()
{
    for(int i=1; i<=50000; i++)
        G[i].erase(G[i].begin(),G[i].end());
    int aux1,aux2,aux3;
    scanf("%d%d%d",&N,&M,&S);
    for(int i=1; i<=N; i++)
        scanf("%d",&vDistC[i]);
    for(int i=1; i<=M; i++)
    {
        scanf("%d%d%d",&aux1,&aux2,&aux3);
        G[aux1].push_back(make_pair(aux2,aux3));
        G[aux2].push_back(make_pair(aux1,aux3));
    }
}
void belmanf(int nodStart)
{
    int nod;
    for(int i=1; i<=N; i++)
        vDist[i]=0x3f3f3f;
    vDist[nodStart]=0;
    bfq.push(nodStart);
    while(!bfq.empty())
    {
        nod=bfq.front();
        bfq.pop();
        for(it=G[nod].begin(); it!=G[nod].end(); it++)
        {
            if(vDist[nod]+it->second<vDist[it->first])
            {
                vDist[it->first]=vDist[nod]+it->second;
                bfq.push(it->first);
            }
        }
    }
}
bool verif()
{
    for(int i=1; i<=N; i++)
    {
        if(vDist[i]!=vDistC[i])
            return false;
    }
    return true;
}
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    int T;
    scanf("%d",&T);
    while(T--)
    {
        citire();
        belmanf(S);
        if(verif())
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}