#include <stdio.h>
#define nmax 50001
#include <vector>
#include <queue>
#define inf 1<<30

using namespace std;

vector < pair <int, int> > G[nmax];
queue <int> q;

int main() {
    freopen ("distante.in", "r", stdin);
    freopen ("distante.out", "w", stdout);
    int T, N, M, S, cmin[nmax], i, a, b, c, D[nmax], m, j;
    bool ok, oki;
    scanf ("%d", &T);
    ++T;

    /*while (--T) {
        scanf ("%d %d %d", &N, &M, &S);
        for (i = 1; i <= N; ++i) {
            cmin[i] = inf;
            G[i].clear();
            scanf ("%d", &D[i]);
        }
        for (i = 1; i <= M; ++i) {
            scanf ("%d %d %d", &a, &b, &c);
            G[a].push_back(make_pair(b,c));
            G[b].push_back(make_pair(a,c));
        }
        cmin[S] = 0;
        ok = 1;
        if (D[S] != 0) {
            ok = 0;
        }
        if (ok) q.push(S);
        while (!q.empty() && ok) {
            a = q.front();
            q.pop();
            m = G[a].size();
            for (i = 0; i < m; ++i) {
                b = G[a][i].first;
                c = G[a][i].second;
                if (cmin[b] > cmin[a] + c) {
                    cmin[b] = cmin[a] + c;
                    q.push(b);
                }
            }
        }
        for (i = 1; i <= N; ++i)
            if (D[i] != cmin[i]) ok = 0, i = N + 1;
        if (ok) printf ("DA\n");
        else printf ("NU\n");
    }*/

    while (--T) {
        scanf ("%d %d %d", &N, &M, &S);
        for (i = 1; i <= N; ++i) {
            cmin[i] = inf;
            G[i].clear();
            scanf ("%d", &D[i]);
        }
        for (i = 1; i <= M; ++i) {
            scanf ("%d %d %d", &a, &b, &c);
            G[a].push_back(make_pair(b,c));
            G[b].push_back(make_pair(a,c));
        }
        ok = 1;
        if (D[S]) ok = 0;
        if (ok) {
            for (i = 1; i <= N; ++i) {
                m = G[i].size();
                for (j = 0; j < m; ++j) {
                    a = G[i][j].first;
                    b = G[i][j].second;
                    if (D[a] + b < D[i] && i != S)
                        ok = 0, j = m, i = N + 1;
                }
            }
        }
        if (ok) {
            for (i = 1; i <= N; ++i) {
                oki = 0;
                m = G[i].size();
                for (j = 0; j < m; ++j) {
                    a = G[i][j].first;
                    b = G[i][j].second;
                    if (D[a] + b == D[i])
                        oki = 1, j = m;
                }
                if (i == S) oki = 1;
                ok = ok && oki;
                if (!ok) i = N + 1;
            }
        }
        if (ok) printf ("DA\n");
        else printf ("NU\n");
    }
    return 0;
}