#include <iostream>
#include <fstream>
#include <queue>
#include <string.h>
#include <vector>

using namespace std;

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

const int maxn = 50005;
const int oo = 0x3f3f3f3f;

int n, m, dist[maxn],start,d[maxn];
vector <pair<int, int> > g[maxn];
bool ok=true;

inline void dijkstra(int stnode) {
    priority_queue <pair<int, int> > q;
    memset(dist, oo, sizeof(dist));
    dist[stnode] = 0;
    q.push(make_pair(0, stnode));
    while(!q.empty()) {
        int cost = q.top().first;
        int node = q.top().second;
        q.pop();
        if(dist[node] != cost)
            continue;
            int nr=g[node].size();
        for(int i=0;i<nr;++i) {
            if(dist[g[node][i].first] > cost + g[node][i].second) {
                dist[g[node][i].first] = cost + g[node][i].second;
                q.push(make_pair(dist[g[node][i].first], g[node][i].first));
            }
        }
    }
    for(int i = 1 ; i <= n ; ++ i)
        if(dist[i] != d[i] )
            {ok=false; break;}


}

int main() {
    int t;
    fin>>t;
    while(t--){
    fin >> n >> m>>start;
        for(int i=1;i<=n;++i) g[i].clear();
    for(int i=1;i<=n;++i)
        fin>>d[i];
    for(int i = 1 ; i <= m ; ++ i) {
        int x, y, z;
        fin >> x >> y >> z;
        g[x].push_back(make_pair(y, z));
        g[y].push_back(make_pair(x, z));
    }

    dijkstra(start);
    if(ok==true) fout<<"DA\n";
    else fout<<"NU\n";

    }
}