#include <cstdio>
#include <map>
#include <algorithm>
#include <vector>
#include <string>
#include <deque>
#define oo 0x3f3f3f3f
#define left(i) (((i)<<1)+1)
#define right(i) (((i)<<1)+2)
#define tata(i) ((i-1)>>1)
#define maxn 1<<16
using namespace std;

int H[maxn], d[maxn], t[maxn], T, n, m, poz[maxn], d1[maxn];

int nh;
struct nod{ int nd, w; nod(int _nd, int _w){ nd=_nd; w=_w;};};

vector< vector<nod> >a;

void dfs(int k)
{
	for(int i=0;i<a[k].size();i++)
		if(d[k]+a[k][i].w<d[a[k][i].nd])
		{
			d[a[k][i].nd]=d[k]+a[k][i].w;
			dfs(a[k][i].nd);
		}
}

int main()
{
	freopen("distante.in", "r", stdin);
	freopen("distante.out", "w", stdout);
	int i, j,p, q, w, s;
	scanf("%d", &T);
	for(i=1;i<=T;i++)
	{	
		a.clear();
		scanf("%d %d %d\n", &n, &m, &s);
		a.resize(n+1);
		for(j=1;j<=n;j++) scanf("%d ", d1+j);
		for(j=1;j<=m;j++)
		{
			scanf("%d %d %d\n", &p, &q, &w);
			a[p].push_back(nod(q, w));
			a[q].push_back(nod(p, w));
		}
		
		memset(d, oo, sizeof(d));
		d[s]=0;
		dfs(s);
		int ok=1;
	//	for(j=1;j<=n;j++) printf("%d ", d[j]);
		//printf("\n");
		for(j=1;j<=n;j++) if(d1[j]!=d[j]){ ok=0; break;}
		if(ok) printf("DA\n");
			else printf("NU\n");
	}
	return 0;
}