#include <bits/stdc++.h>
using namespace std;

int t, n, m, s;
int d[50005], w[50005];
vector <pair <int, int> > v[50005];
priority_queue <pair <int, int> > q;
inline void dijkstra(){
    q.push(make_pair(0, s));
    d[s] = 0;
    while(!q.empty()){
        int nod = q.top().second;
        q.pop();
        for(vector <pair <int, int> > :: iterator it = v[nod].begin() ; it != v[nod].end() ; ++it){
            if(d[it->first] > d[nod] + it->second){
                d[it->first] = d[nod] + it->second;
                q.push(make_pair(-d[it->first], it->first));
            }
        }
    }
}
inline void solve(){
    scanf("%d%d%d", &n, &m, &s);
    for(int i = 1; i <= n ; ++i) {v[i].clear(), d[i] = 2000000000; scanf("%d", &w[i]);}
    int x, y, z;
    for(int i = 1; i <= m ; ++i){
        scanf("%d%d%d", &x, &y, &z);
        v[x].push_back(make_pair(y, z));
        v[y].push_back(make_pair(x, z));
    }
    dijkstra();
    for(int i = 1; i <= n ; ++i) if(d[i] != w[i]){printf("NU\n"); return ;}
    printf("DA\n");
}
int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    scanf("%d", &t);
    while(t--) solve();
    return 0;
}