#include <iostream>
#include <fstream>
#include <set>

using namespace std;

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

int T,N,M,start;
int d[50001],bolnav[50001];
const int INF = 2e9;

set<pair<int,int>> v[50001];
set<pair<int,int>> Q;

int verif(int N){
    for(int i = 1; i <= N;i++){
        if(bolnav[i] != d[i])
            return 0;
    }
    return 1;
}

void init(int k,int nod){
    for(int i = 1; i <= k; i++)
        d[i] = INF;
    d[nod] = 0;
}

void dijkstra(int nod){
    Q.insert(make_pair(0,nod));
    while(!Q.empty()){
        nod = Q.begin()->second;
        Q.erase(Q.begin());
        for(set<pair<int,int>>::iterator it = v[nod].begin(); it != v[nod].end(); it++){
            int nod_next = it->first;
            int cost_next = it->second;
            if(d[nod] + cost_next < d[nod_next]){
                Q.erase(make_pair(d[nod_next],nod_next));
                d[nod_next] = d[nod] + cost_next;
                Q.insert(make_pair(d[nod_next],nod_next));
            }
        }
    }
}

int main()
{
    fin >> T;
    for(int i = 1; i <= T; i++){
        fin >> N >> M >> start;
        for(int j = 1; j <= N; j++){
            fin >> bolnav[j];
        }
        int x,y,cost;
        int ok = 1;
        for(int j = 1; j <= M; j++){
            fin >> x >> y >> cost;
            if(bolnav[x] + cost < bolnav[y]) {
                ok = 0;
            }
            if(bolnav[y] + cost < bolnav[x]){
                ok = 0;
            }
            ///v[x].insert(make_pair(y,cost));
            ///v[y].insert(make_pair(x,cost));
        }
        ///init(N,start);
        ///dijkstra(start);
        if(ok == 1 && d[start] == 0)
            fout << "DA" << '\n';
        else
            fout << "NU" << '\n';

    }
    return 0;
}