#include <fstream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

ifstream cin("distante.in");
ofstream cout("distante.out");

#define DIM 50001
#define INF (1 << 29)

vector <pair<int ,int>> v[DIM];
int t, n, m, s, dist[DIM], a[DIM], x, y, c;

static inline void Dijkstra(int k) {
    for(int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[k] = 0;    ///distanta pana la el insusi e 0;

    set<pair<int, int>> d;  ///pentru a fi ordonate crescator dupa cost;
    d.insert({0, k});       ///costul si nodul;
    while(!d.empty()) {
        int node = d.begin()->second;
        d.erase(d.begin());

        for(auto e : v[node]) {
            int nod = e.first;
            int cost = e.second;    ///costul de la node la nod;
            if(dist[nod] > dist[node] + cost) {
                if(dist[nod] != INF)    ///daca era in set il elimin;
                    d.erase(d.find({dist[nod], nod}));
                dist[nod] = dist[node] + cost;
                d.insert({dist[nod], nod});
            }
        }
    }
}

static inline bool check() {
    for(int i = 1; i <= n; i++)
        if(dist[i] != a[i]) ///daca am 2 distante diferite e fals;
            return 0;
    return 1;
}

int main() {
    cin >> t;
    while(t--) {
        cin >> n >> m >> s;
        for(int i = 1; i <= n; i++)
            cin >> a[i];    ///distantele initiale;
        for(int i = 1; i <= m; i++) {
            cin >> x >> y >> c;
            v[x].push_back({y, c}); ///retin nodul si costul;
            v[y].push_back({x, c});
        }

        Dijkstra(s);
        if(check())
            cout << "DA" << '\n';
        else cout << "NU" << '\n';

        ///resetez vectorul
        for(int i = 1; i <= n; i++)
            v[i].clear();
    }

    return 0;
}