#include <fstream>
#include <queue>
#include <cstring>
#include <vector>
#include <climits>

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

int t,n,m,s,i,j,x,y,c,v[50005],d[50005];
bool viz[50005];
struct arc{
    int nod,c;
};
vector <arc> g[50005];
struct myComparison{
    bool operator()(const int& a, const int& b)const{
        return d[a]>d[b];
    }
};
priority_queue <int, vector <int>, myComparison> h;

void dijkstra(int s){
    d[s]=0;
    h.push(s);
    while(!h.empty()){
        if(viz[h.top()]){
            h.pop();
            continue;
        }
        int nod = h.top();
        h.pop();
        viz[nod]=1;
        for(int i=0;i<g[nod].size();i++){
            int nou = g[nod][i].nod;
            int cost = g[nod][i].c;
            if(d[nou]>d[nod]+cost){
                d[nou]=d[nod]+cost;
                h.push(nou);
                viz[nou]=0;
            }
        }
    }
    memset(viz,0,sizeof(viz));
}

int valid(){
    for(i=1;i<=n;i++)
        if(d[i]!=v[i])
            return 0;
    return 1;
}

int main(){
    fin>>t;
    for(j=1;j<=t;j++){
        fin>>n>>m>>s;
        for(i=1;i<=n;i++)
            fin>>v[i];
        for(i=1;i<=m;i++){
            fin>>x>>y>>c;
            g[x].push_back({y,c});
            g[y].push_back({x,c});
        }
        for(i=1;i<=n;i++)
            d[i]=INT_MAX;
        dijkstra(s);
        if(valid())
            fout<<"DA"<<'\n';
        else
            fout<<"NU"<<'\n';
    }
    return 0;
}