#include <bits/stdc++.h>
#include<fstream>
#include<vector>
#include<map>
#include<queue>
std::ifstream f("distante.in");
std::ofstream g("distante.out");
int t, n, m, s, c, x, y, rez, suma_maxim = -1001;

std::vector<int> dijkstra(int nod, std::vector<std::vector< std::pair<int, int>> > lista_cost){
    std::vector<int> dist(n, INT_MAX);

    dist[nod] = 0;

    std::set<std::pair<int, int>> s;

    s.insert( std::make_pair(0, nod));

    while(!s.empty()){
        int nod = s.begin()->second;

        s.erase(s.begin());

        for(auto i = lista_cost[nod].begin() ; i != lista_cost[nod].end(); i++){
            int vecin = i->first;
            int cost = i->second;

            if(dist[vecin] > dist[nod] + cost){
                s.erase(std::make_pair(dist[vecin], vecin));
                dist[vecin] = cost + dist[nod];
                s.insert(std::make_pair(dist[vecin], vecin));
            }
        }
    }

    return dist;
}

int main() {
    f>>t;

    while(t--){

        f>>n>>m>>s;

        std::vector<std::vector< std::pair<int, int>> > lista_cost;
        std::vector< std::pair<int, int>> p;
        std::vector<int> dij, bronzarel(n);

        for(auto i = 0; i<n ; i++)
            lista_cost.push_back(p);

        for(int i = 0 ; i < n ; i++){
            f >> x;
            bronzarel[i] = x;
        }

        for(int i = 0 ; i < m ; i++) {
            f >> x >> y >> c;
            if(x != y){
                lista_cost[x - 1].push_back(std::make_pair(y - 1, c));
                lista_cost[y - 1].push_back(std::make_pair(x - 1, c));
            }
        }

        dij = dijkstra(s-1 , lista_cost);

        if( bronzarel == dij) g<<"DA";
        else g<<"NU";
        g<<"\n";
    }

    return 0;
}