#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 50005
#define INF 0x3f3f3f

using namespace std;

int N, M, S, d[NMAX], dAux[NMAX];
vector <pair <int, int> > g[NMAX];
queue <int> Q;

void reset()
{
    for(int i=1; i<=NMAX; ++i)
        g[i].erase(g[i].begin(), g[i].end());
}

void read()
{
    reset();

    scanf("%d%d%d", &N, &M, &S);
    for(int i=1; i<=N; ++i)
        dAux[i] = INF;
    dAux[S] = 0;
    for(int i=1; i<=N; ++i)
        scanf("%d", &d[i]);

    for(int i=1; i<=M; ++i)
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        g[a].push_back(make_pair(b, c));
        g[b].push_back(make_pair(a, c));
    }
}

bool verificareVect()
{
    for(int i=1; i<=N; ++i)
        if(d[i] != dAux[i])
            return false;
    return true;
}

bool solve()
{
    Q.push(S);
    int nod;
    vector <pair <int, int> >::iterator it;
    while(!Q.empty())
    {
        nod = Q.front();
        Q.pop();

        for(it = g[nod].begin(); it != g[nod].end(); ++it)
            if(dAux[nod] + it->second < dAux[it->first])
            {
                dAux[it->first] = dAux[nod] + it->second;
                Q.push(it->first);
            }
    }
    return verificareVect();
}

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

    int T;
    scanf("%d", &T);
    for(int i=1; i<=T; ++i)
    {
        read();
        if(solve() == true)
            printf("DA\n");
        else
            printf("NU\n");
        reset();
    }
    return 0;
}