#include<fstream>
#include<vector>
#include<string>
#include<queue>
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");

int t;
int n,m,s;
int cnt;
int d[50005],viz[50005];
vector<pair<int,int> > G[15][50005];
queue<int> Q;

string ans(int t){

    if(d[s]!=0) return "NU";
    Q.push(s);
    viz[s]=1;
    cnt=n;
    while(!Q.empty()){

        int x=Q.front();
        Q.pop(); --cnt;

        for(int i=0;i<G[t][x].size();i++){

            int y=G[t][x][i].first;
            int z=G[t][x][i].second;

            if(!viz[y] && d[x]+z==d[y]){

                Q.push(y);
                viz[y]=1;

            }

        }

    }

    if(cnt>0) return "NU";
    return "DA";

}

int main(){

    cin>>t;
    for(int r=1;r<=t;r++){

        cin>>n>>m>>s;

        for(int i=1;i<=n;i++)
            viz[i]=0;

        for(int i=1;i<=n;i++)
            cin>>d[i];

        for(int i=1;i<=m;i++){

            int x,y,z;
            cin>>x>>y>>z;
            G[r][x].push_back(make_pair(y,z));
            G[r][y].push_back(make_pair(x,z));

        }

        cout<<ans(r)<<'\n';

    }

}