#include <fstream>
#include <vector>
#include <deque>
#define K 50002
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int n,m,i,t,x,y,c,s,calc[K],viz[K],d[K];
vector < pair<int,int> > v[K];
deque <int> q;
int main(){
    for(fin>>t;t--;){
        fin>>n>>m>>s;
        for(i=1;i<=n;i++){
            viz[i]=0;
            d[i]=999999999;
            v[i].clear();
            fin>>calc[i];
        }
        for(i=1;i<=m;i++){
            fin>>x>>y>>c;
            v[x].push_back({y,c});
            v[y].push_back({x,c});
        }
        d[s]=0; viz[s]=1;
        q.push_back(s);
        while(!q.empty()){
            int nod=q.front();
            viz[nod]=0;
            q.pop_front();
            for(i=0;i<v[nod].size();i++){
                int vecin=v[nod][i].first;
                int cost=v[nod][i].second;
                if(d[nod]+cost<d[vecin]){
                    d[vecin]=d[nod]+cost;
                    if(!viz[vecin]){
                        viz[vecin]=1;
                        q.push_back(vecin);
                    }
                }
            }
        }
        int ok=1;
        for(i=1;i<=n;i++)
            if(calc[i]!=d[i]){fout<<"NU\n"; ok=0; break;}
        if(ok) fout<<"DA\n";
    }
    return 0;
}