#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std ;

#define maxn 50001

int tst ;

int n, m, sursa ;
int dist[maxn] ;

int main()
{
	
	freopen("distante.in", "r", stdin);
	freopen("distante.out", "w", stdout);
	
	scanf("%d", &tst);
	
	while( tst )
	{
		memset( dist, 0, sizeof(dist) ) ;
		
		scanf("%d%d%d", &n, &m, &sursa);
		
		for(int i = 1; i <= n; ++i )
			scanf("%d", &dist[i]);
		
		bool ok = true ;
		
		if( dist[sursa] )
			ok = false ;
		
		for(int i = 1; i <= m; ++i )
		{
			int a, b, cost ;
			
			scanf("%d%d%d", &a, &b, &cost);
			
			if( dist[b] > dist[a] + cost )
			{
				ok = false ;
				break ;
			}	
		}
		
		if( ok == true )
			printf("DA\n");
		else
			printf("NU\n");
		
		--tst ;
	}	
	
	return 0 ;
	
}