#include<stdio.h>
#include<vector>
using namespace std;
#define inf 2000000000
#define nmax 50002
#define mmax 250002
#define nrmax 1000000
#define f first
#define s second
int n,m,c[nmax],ok[nmax],nod,T;
vector<int> q;
vector< pair<int,int> > v[nmax];
int C[nmax];

void sol()
{
	int p,u,i,lim,nod,nr=0;
	p=u=0;
	q.push_back(1);
	while(p<=u)
	{
		nod=q[p];
		ok[nod]=0;
		lim=v[nod].size();
		for(i=0;i<lim;i++)
			if(c[nod]+v[nod][i].s<c[v[nod][i].f])
			{
				c[v[nod][i].f]=c[nod]+v[nod][i].s;
				if(ok[v[nod][i].f]==0)
				{
					q.push_back(v[nod][i].f);
					ok[v[nod][i].f]=1;
					++u;
				}
				nr++;				
			}
		p++;
		if(nr>nrmax)
			break;
	}
}

int main()
{
	freopen("distante.in","r",stdin);
	freopen("distante.out","w",stdout);
	
	scanf("%d", &T);
	while(T--)
	{
	scanf("%d%d %d",&n,&m,&nod);
	int i,a,b,cost;
	for (i=1;i<=n;++i) scanf("%d", &C[i]);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&b,&cost);
		v[a].push_back(make_pair(b,cost));
		v[b].push_back(make_pair(a,cost));
	}
	for(i=1;i<=n;i++)
		if (i!=nod)
		c[i]=inf;
	sol();
	int ok=0;
	for(i=1;i<=n && !ok;i++)
		if (C[i]!=c[i])
			ok=1;
		
	if (!ok) printf("DA\n");
     else printf("NU\n");
	
		//printf("%d ",c[i]);
	}
	return 0;
}