#include<fstream>
#include<cstdio>

using namespace std;
ifstream f ("distante.in");
ofstream g ("distante.out");

const int MaxN = 50005;

int T,n,m,S,d[MaxN];

int rezolv()
{
	f >> n >> m >> S;
	int x,y,c;
	for( int i = 1 ; i <= n ; i++ )
		f >> d[i];
	if( d[S] )
		return 0;
	for( int i = 1 ; i <= m ; i++ )
		{
			f >> x >> y >> c;
			if( d[x] + c < d[y] || d[y] + c < d[x] )
				return 0;
		}
	return 1;
}

int main()
{
	f >> T;
	while( T-- )
			if( rezolv() )
				g << "DA\n";
				else
				g << "NU\n";
	f.close();
	g.close();
	return 0;
}