#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

typedef pair<int, int> pii;

const int MAXN = 5e4;
const int MAXM = 1e5;
const int INF = 1 << 30;

bool compare(vector<int> d1, vector<int> d2) {
    int sz = d1.size();
    for (int i = 1; i < sz; i++)
        if (d1[i] != d2[i]) return false;
    return true;
}

void dijkstra(int init, vector<int> &dist, vector<pii> graf[MAXN+1]) {
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    pq.push({0, init});
    dist[init] = 0;

    while (!pq.empty()) {
        int distInit = pq.top().first;
        int nod = pq.top().second;
        pq.pop();

        if (distInit < dist[nod])
            continue;

        for (auto vec: graf[nod]) {
            int cost = vec.first;
            int nodExt = vec.second;

            if (dist[nodExt] > dist[nod] + cost)
                dist[nodExt] = dist[nod] + cost,
                pq.push( {dist[nodExt], nodExt} );
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    fin.tie(0);

    int t, n, m, start, x, y, p;
    in >> t;

    for (int tt = 1; tt <= t; tt++) {
        in >> n >> m >> start;
        vector<int> initDist(n+1);
        vector<pii> graf[MAXN+1];

        for (int i = 1; i <= n; i++)
            in >> initDist[i];

        for (int i = 1; i <= m; i++) {
            in >> x >> y >> p;

            graf[x].push_back({p, y});
            graf[y].push_back({p, x});
        }

        vector<int> dist(n+1, INF);
        dijkstra(start, dist, graf);

        //for (auto e: dist) cout << (e == INF ? -1 : e) << ' ';
        //cout << '\n';

        out << (compare(dist, initDist) ? "DA\n" : "NU\n");
    }

    return 0;
}