#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <vector>
using namespace std;

#define pb push_back
#define mp make_pair
#define MAXN 50100
#define INF 1000000000

int N, M, d[MAXN]; vector<int> G[MAXN], C[MAXN];
set< pair<int, int> > T;

void algo(int sursa) {
    int i, j, k, val, x;

    for(i = 1; i <= N; i++) d[i] = INF;
    T.insert( mp(0, sursa) );

    while( T.size() > 0 )
    {
        val = (*T.begin()).first, x = (*T.begin()).second;
        T.erase(*T.begin());
        for(i = 0; i < G[x].size(); i++)
         if(d[ G[x][i] ] > val + C[x][i] )
            d[ G[x][i] ] = val + C[x][i], T.insert(mp(d[G[x][i]],G[x][i]));
    }
}

int main() {
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);

    int k;
    scanf("%d", &k);
    for(int i=1;i<=k;i++) {
        if(i!=1) {
            memset(G, 0, sizeof(G));
            memset(C, 0, sizeof(C));
            T.clear();
        }
        int sursa;
        scanf("%d %d %d", &N, &M, &sursa);

        int dist[N];
        for(int j=1;j<=N;j++) scanf("%d", &dist[j]);

        for(int j=1;j<=M;j++) {
            int x,y,c;
            scanf("%d %d %d", &x, &y, &c);
            G[x].pb(y); C[x].pb(c);
        }
        algo(sursa);
        bool ok=1;
        for(int j=1;j<=N;j++) if(dist[j] != (d[j] != INF ? d[j] : 0)) ok=0;
        if(ok) cout<<"DA\n";
        else cout<<"NU\n";
    }

    return 0;
}