#include<stdio.h>
#include<vector>
#include<set>
#include<utility>
using namespace std;
#define nmax 50005
#define inf 1<<30
struct element{long n, c;};
long n, m, s, i, ii, t, d[nmax], dmin[nmax], a, b, c;
vector <element> ma[nmax];
vector <element>::iterator it;
set <pair <long, long> >   h;
pair <long, long> x;
element el;
bool ok;

void citire()
{
    scanf("%ld %ld %ld",&n,&m,&s);
    for (i=1;i<=n;i++)
    {
        scanf("%ld",&d[i]);
        ma[i].clear();
    }
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld %ld",&a,&b,&c);
        el.n=b; el.c=c;
        ma[a].push_back(el);
    }
}

void rezolvare()
{
    //INITIALIZEAZA!!!!!!!
    h.clear();
    for (i=1;i<=n;i++)
        if (i!=s)
            dmin[i]=inf;
    h.insert(make_pair(0,s));
    while (h.size())
    {
        x=*h.begin();   h.erase(h.begin());
        if (dmin[x.second]!=d[x.second])
        {   ok=0; break; }
        for (it=ma[x.second].begin();it!=ma[x.second].end();it++)
            if (dmin[(*it).n]>dmin[x.second]+(*it).c)
            {
                h.erase(make_pair(dmin[(*it).n],(*it).n));
                dmin[(*it).n]=dmin[x.second]+(*it).c;
                h.insert(make_pair(dmin[(*it).n],(*it).n));
            }
    }
    for (i=1;<=n;i++)
    {
        if (dmin[i]==inf)
            dmin[i]=0;
        if  (dmin[i]!=d[i])
            ok=0;
    }
}

int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%ld",&t);
    for (ii=1;ii<=t;ii++)
    {
        citire();
        ok=1;
        rezolvare();
        if (ok)
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}