# include <fstream>
# include <vector>
# include <deque>
# define DIM 50010
# define INF 1000000000
# define f first
# define s second
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
vector <pair<int,int> > Lista[DIM];
deque <int> c;
int d[DIM],dp[DIM],Marcat[DIM],n,m,x,y,cost,ok,ns,nc,nv,i,j,r,t;
int main () {
    fin>>t;
    for(r=1;r<=t;r++){
        fin>>n>>m>>ns;
        for(i=1;i<=n;i++){
            fin>>dp[i];
            d[i]=INF;
            Marcat[i]=0;
        }
        for(i=1;i<=n;i++)
            Lista[i].resize(0);
        for(i=1;i<=m;i++){
            fin>>x>>y>>cost;
            Lista[x].push_back(make_pair(y,cost));
            Lista[y].push_back(make_pair(x,cost));
        }
        Marcat[ns]=1;
        d[ns]=0;
        c.push_back(ns);
        while(!c.empty()){
            nc=c.front();
            for(i=0;i<Lista[nc].size();i++){
                nv=Lista[nc][i].f;
                cost=Lista[nc][i].s;
                if(d[nv]>d[nc]+cost){
                    d[nv]=d[nc]+cost;
                    if(Marcat[nv]==0){
                        c.push_back(nv);
                        Marcat[nv]=1;
                    }
                }
            }
            Marcat[nc]=0;
            c.pop_front();
        }
        ok=1;
        for(i=1;i<=n;i++)
            if(d[i]!=dp[i])
                ok=0;
        if(ok)
            fout<<"DA\n";
        else
            fout<<"NU\n";
    }
    return 0;
}