#include <bits/stdtr1c++.h>
#define maxn 50001
#define INF 50001
using namespace std;

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

int T, M, N, S;
vector <int> cost;
vector < vector <pair <int, int> > > A;
vector <int> V;
vector <int> D;

void graf(int S) {
    int VfMin, dMin;
    for(int j=1; j<N; j++) {
        dMin = INF;
        for(int i=1; i<= N; i++) {
            if(!V[i] && dMin > D[i]) {
                dMin = D[i];
                VfMin = i;
            }
        }
        V[VfMin] = 1;
        for(int i=1; i<=N;i++) {
            if(!V[i]) {
                for(int k=0; k < A[VfMin].size(); k++) {
                    if(A[VfMin][k].first == i && D[i] > dMin + A[VfMin][k].second) {
                        D[i] = dMin + A[VfMin][k].second;
                    }
                }
            }
        }

    }
}

void init() {
    int c, x, y;
    bool match = true;
    fin >> T;
    for(int i=0; i < T; i++) {
        fin >> N >> M >> S;
        A.clear();
        A.resize(N+1);
        cost.clear();
        cost.push_back(-1);
        D.clear();
        V.clear();
        V.resize(N+1);
        V[S] = 1;
        for(int j = 1; j<=N;j++){
            fin >> c;
            cost.push_back(c);
        }
        for(int j=0; j <= N; j++) D.push_back(INF);
        for(int j=0; j < M; j++) {
            fin >> x >> y >> c;
            A[x].push_back(make_pair(y,c));
            A[y].push_back(make_pair(x, c));
        }
        for(int j=0; j < A[S].size(); j++) {
            D[A[S][j].first] = A[S][j].second;
        }
        graf(S);
        for(int j=1; j <= N; j++) {
            if(D[j] == INF) D[j] = 0;
            if(D[j] != cost[j]){
                match = false;
            }
        }
        if(match) fout << "DA" << endl;
        else fout << "NU" << endl;
    }
}

int main()
{
    init();
    return 0;
}