#include <bits/stdc++.h>
using namespace std;

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

int inf = (1<<30)-1;

vector <pair<int,int> > g[50002];
int dist[50002];

int n,m,t;

priority_queue < pair<int, int> , vector< pair<int, int> > , greater< pair<int, int> > > q;
void djk(int start){

    for(int i = 1; i<=n; i++)
        dist[i] = inf;
    dist[start] = 0;
    q.push({0, start});
    pair<int, int> current;


    while(!q.empty()){
        current = q.top();
        q.pop();
        if(current.first > dist[current.second]) continue ;

        for(unsigned int i = 0; i<g[current.second].size(); i++){
            int nb = g[current.second][i].first;
            int c = g[current.second][i].second;

            if(dist[current.second] + c < dist[nb]){
                dist[nb] = dist[current.second] + c;
                q.push({dist[nb], nb});
            }
        }
    }

}

int main(){
    int s, temp[50002];
    bool fl;
    fin>>t;
    for(int ii = 0; ii<t; ii++){
        fin >> n>>m>>s;
        for(int i = 1; i<=n; i++){
            fin>>temp[i];
        }
        for(int i = 1; i<=m; i++){
            int x,y,c;
            fin>>x>>y>>c;
            g[x].push_back(make_pair(y,c));
            g[y].push_back(make_pair(x,c));
        }
        djk(s);
        fl = true;
        for(int i = 1; i <= n; i++){
           g[i].clear();


            if((dist[i] != inf && dist[i] != temp[i] )||( dist[i] == inf && temp[i] != 0)){
                fl = false;
                break;
            }
        }
        fl? fout<<"DA\n" : fout<<"NU\n";
    }


    return 0;
}