#include<fstream>
#include<vector>
#include<queue>
#define inf 0x3f3f3f
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
struct dij
{
	int nod,cost;
};
vector< vector <dij> > a(50001);
vector<int> d(50001,inf);
queue<int>  q;
vector<int> vek(50001);
void dijkstra(int x)
{
	q.push(x);
	int i;
	d[x]=0;
	while(!q.empty())
	{
		x=q.front();
		for(i=0;i<a[x].size();++i)
		{
			if(d[a[x][i].nod]>d[x]+a[x][i].cost)
				d[a[x][i].nod]=d[x]+a[x][i].cost,q.push(a[x][i].nod);
		}
		q.pop();
	}
}
int t,n,m,p1,p2,p3,i,j,k,ok=0,np,w;
int main()
{
	f>>t;
	for(i=1;i<=t;i++)
	{
		
		f>>n>>m>>np;
		for(k=1;k<=n;k++)
			f>>vek[k];
		for(j=1;j<=m;j++)
		{
			f>>p1>>p2>>p3;
			a[p1].push_back( (dij) {p2,p3} );
		}
		dijkstra(np);
		ok=1;
		for(w=1;w<=n;w++)
			if(vek[w]!=d[w])
				ok=0;
		if(ok)
			g<<"DA\n";
		else
			g<<"NU\n";
	}
}