#include <bits/stdc++.h>

using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int dist[50005];

int main()
{
    int i, N, M, S, T;
    int x, y, c, k;
    fin >> T;
    for(int test = 1; test <= T; test++){
         k = 1;
         fin >> N >> M >> S;
         for(i = 1; i <= N; i++)
            fin >> dist[i];
         if (dist[S] != 0) k = 0;
         for(i = 1; i <= M; i++)
         {
             fin >> x >> y >> c;
             if(dist[x] + c < dist[y] || dist[y] + c < dist[x])
                k = 0;
         }
         if( k == 1) fout << "DA\n";
         else fout <<"NU\n";
     }
     fout.close();
     return 0;
}