#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#define INF 2100000000

using namespace std;

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

vector< pair<int, int> > v[50005];
set   < pair<int, int> > s;
int f[50005], sold[50005], d[50005];
int t, n, m, p, ii, jj, cc;
int nod;

int main (){
    fin>>t;
    while(t--){
        fin>>n>>m>>p;
        for(int i=1; i<=n; i++)
            fin>>sold[i];

        for(int i=1; i<=m; i++){
            fin>>ii>>jj>>cc;
            v[ii].push_back( {jj, cc} );
            v[jj].push_back( {ii, cc} );
        }

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

        d[p]=0;
        s.insert( {0, p} );
        while(!s.empty()){
            nod=s.begin() -> second;
            s.erase(s.begin());

            for(int i=0; i<v[nod].size(); i++)
                if(d[ v[nod][i].first ] > d[nod] + v[nod][i].second){
                    s.erase ( {d[ v[nod][i].first ], v[nod][i].first} );
                    d[ v[nod][i].first ]=d[nod] + v[nod][i].second;
                    s.insert( {d[ v[nod][i].first ], v[nod][i].first} );
                }
        }

        int ok=1;
        for(int i=1; i<=n; i++){
            if(d[i] != sold[i])
                ok=0;
            v[i].clear();
        }


        if(ok == 0)
            fout<<"NU\n";
        else
            fout<<"DA\n";
    }
    return 0;
}