#include <iostream>
#include <queue>
#include <vector>
#include <cstring>

#define NMAX 50005
#define INF ((1 << 30) - 1)

using namespace std;

typedef pair<int, int> pii;

int n, m, sn, bronzarel[NMAX], zaharel[NMAX];
bool v[NMAX];
vector<pii> adj[NMAX];
priority_queue<pii, vector<pii>, greater<pii> > pq;

void dij(const int SN = sn) {
    pq.push({0, SN});
    zaharel[SN] = 0;
    while(!pq.empty()) {
        const int crt = pq.top().second;
        pq.pop();

        if(v[crt]) continue;
        v[crt] = 1;

        for(const auto &el : adj[crt]) {
            const int ncrt = el.first;
            if(zaharel[ncrt] > zaharel[crt] + el.second) {
                zaharel[ncrt] = zaharel[crt] + el.second;
                pq.push({zaharel[ncrt], ncrt});
            }
        }
    }
}

void solve() {
    scanf("%d%d%d", &n, &m, &sn);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", &bronzarel[i]);
        zaharel[i] = INF;
    }
    for(int x, y, z; m; --m) {
        scanf("%d%d%d", &x, &y, &z);
        adj[x].push_back({y, z});
        adj[y].push_back({x, z});
    }
    dij(sn);
    bool ok = 1;
    for(int i = 1; i <= n && ok; ++i)
        ok = (zaharel[i] == bronzarel[i]);
    ok ? printf("DA\n") : printf("NU\n");

    for(int i = 1; i <= n; ++i)
        adj[i].clear();
    memset(v, 0, sizeof(v));
}

int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    short tests;
    scanf("%hd", &tests);
    while(tests--) solve();
    return 0;
}