#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

#define maxN 50005
#define PB push_back
#define MKP make_pair
#define inf (1 << 30)

int N, M, S;
int cost[maxN], D[maxN];
bool cont[maxN];
vector < pair <int, int> > lista[maxN];
queue <int> Q;


int solve ()
{
	for (int i = 1; i <= N; ++ i) cost[i] =  inf;
	
	Q.push (S);
	cost[S] = 0;
	cont[S] = true;
	
	while (! Q.empty ())
	{
		int nod = Q.front();
		Q.pop();
		cont[nod] = false;
		
		for (unsigned int i = 0; i < lista[nod].size(); ++ i)
		{
			int nod2 = lista[nod][i].first, cost2 = lista[nod][i].second;
			
			if (cost[nod2] <= cost[nod] + cost2) continue;
			
			cost[nod2] = cost[nod] + cost2;
			if (cont[nod2]) continue;
			
			Q.push (nod2);	
		}
	}
	
	for (int i = 1; i <= N; ++ i)
		if (cost[i] != D[i]) return 0;
	
	return 1;	
}


int main()
{
	freopen ("distante.in", "r", stdin);
	freopen ("distante.out", "w", stdout);
	
	int T;
	
	scanf ("%d", &T);
	
	while (T --)
	{
		scanf ("%d %d %d", &N, &M, &S);
		
		for (int i = 1; i <= N; ++ i) scanf ("%d", &D[i]);
		
		while (M --)
		{
			int a, b, c;
			
			scanf ("%d %d %d", &a, &b, &c);
			
			lista[a].PB ( MKP (b, c) );
			lista[b].PB ( MKP (a, c) );
		}
		
		if (solve ()) printf ("DA\n");
		else printf ("NU\n");
		
		for (int i = 1; i <= N; ++ i) lista[i].clear();
	}
	
	return 0;
}