#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
ifstream in("distante.in");
ofstream out("distante.out");
int b[50005];
vector<vector<pair<int,int> > > a;
int s,n,m;
int ver()
{
	if (b[s]!=0)
		return 0;
	int i;
	vector<pair<int,int> >::iterator it;
	FOR(i,1,n)
	{
		fori(it,a[i])
			if (b[it->ss]+it->fs<b[i])
				return 0;
	}
	return 1;
}
int main()
{
	int t,i,x,y,z;
	in>>t;
	for(;t;t--)
	{
		in>>n>>m>>s;
		a.resize(n+1,vector<pair<int,int> >(0));
		FOR(i,1,n)
		{
			in>>b[i];
		}
		FOR(i,1,m)
		{
			in>>x>>y>>z;
			a[x].pb(mp(z,y));
			a[y].pb(mp(z,x));
		}
		if(ver())
			out<<"DA\n";
		else
			out<<"NU\n";
		a.clear();
	}
	in.close();
	out.close();
	return 0;
}