#include <bits/stdc++.h>
#define X first
#define Y second
#define INF INT_MAX/2
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int n,m,start,i,x,y,z,D[50010],D1[50010],ok,t,nod;
set<pair<int,int> > s;
vector<pair<int,int> > L[50010];
int main(){
    for(fin>>t;t--;){
        fin>>n>>m>>start;
        for(i=1;i<=n;i++)
            fin>>D1[i],D[i]=INF;
        for(i=1;i<=m;i++){
            fin>>x>>y>>z;
            L[x].push_back(make_pair(y,z));
            L[y].push_back(make_pair(x,z));
        }
        D[start]=0;
        s.insert(make_pair(0,start));
        ok=1;
        while(!s.empty()){
            nod=s.begin()->Y;
            s.erase(s.begin());
            for(i=0;i<L[nod].size();i++){
                int vec=L[nod][i].X;
                int cost=L[nod][i].Y;
                if(D[vec]>D[nod]+cost){
                    s.erase(make_pair(D[vec],vec));
                    D[vec]=D[nod]+cost;
                    s.insert(make_pair(D[vec],vec));
                }
            }
        }
        for(i=1;i<=n;i++)
            if(D1[i]!=D[i]){
                ok=0;
                break;
            }
        if(ok)
            fout<<"DA\n";
        else
            fout<<"NU\n";
        for(i=1;i<=n;i++)
            L[i].clear();
    }
    return 0;
}