#include <iostream>
#include <fstream>
#include <list>
#define INF 1<<30
using namespace std;

ifstream f("minusk.in");
ofstream g("minusk.out");

int t;
int n,s,m;
list <int> adj[50500],cost[50500];
int bronz[50500];
bool viz[50500];
int dist[50500];

bool dijkstra(int source)
{
    for(int i=1;i<=n;++i)
        viz[i]=0,dist[i]=INF;
    dist[source]=0;
    viz[source]=1;

}
int main()
{
    f>>t;
    for(int i=1;i<=t;++i)
    {
        f>>n>>m>>s;
        for(int j=1;j<=n;++j)
            f>>bronz[j];
        int a,b,c;
        for(int j=1;j<=m;++j)
        {
            f>>a>>b>>c;
            adj[a].push_back(b);
            cost[a].push_back(c);
            adj[b].push_back(a);
            cost[b].push_back(c);
        }
        if(dijkstra(s))
            g<<"DA"<<endl;
        else
            g<<"NU"<<endl;
    }

    return 0;
}