#include <bits/stdc++.h>
#define NMAX 50010
#define oo 99999999
#define mp make_pair

using namespace std;

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

int T;
int n, m, s;
int distInit[NMAX];
int dist[NMAX];
int x, y, w;
bool ok;
vector<pair<int, int> > v[NMAX];
priority_queue<pair<int,int> > pq;
bitset<NMAX> viz;

void initGraf()
{
    for(int i=1; i<=n; i++)
        v[i].clear();
}

void citireGraf()
{
    fin >> n >> m >> s;
    for(int i=1; i<=n; i++)
        fin >> distInit[i];
    while(m--)
    {
        fin >> x >> y >> w;
        v[x].push_back(mp(w, y));
        v[y].push_back(mp(w, x));
    }
}

void initVect()
{
    for(int i=1; i<=n; i++)
    {
        viz[i] = 0;
        dist[i] = oo;
    }
    dist[s] = 0;
}

void dijstra()
{
    int nod, dst;
    pq.push(mp(0, s));
    while(!pq.empty())
    {
        nod = pq.top().second;
        dst = -pq.top().first;
        pq.pop();
        if(viz[nod])
            continue;
        viz[nod] = 1;

        for(auto vec:v[nod])
        {
            if(dist[vec.second] > dst + vec.first)
            {
                dist[vec.second] = dst + vec.first;
                pq.push(mp(-dist[vec.second], vec.second));
            }
        }
    }
}

bool solve()
{
    for(int i=1; i<=n; i++)
        if(dist[i] != distInit[i])
            return 0;
    return 1;
}


int main()
{
    fin >> T;
    while(T--)
    {
        initGraf();
        citireGraf();
        if(distInit[s] != 0)
        {
            fout << "NU\n";
            continue;
        }
        initVect();
        dijstra();
        ok = solve();
        if(ok == 1)
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}