#include<fstream>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
ofstream g("distante.out");

int i,j,n,m,t,sursa,x,y,cost1,ok;
unsigned long d[50010],c[50010],val[50010];
struct muchie
{
	int nod,cost;
};
vector<muchie> a[50010];
void det(int sursa)
{
	int i,x;
	queue<int> q;
	q.push(sursa);
	memcpy(c,val,sizeof(c));
	c[sursa]=0;
	while(!q.empty())
	{
		x=q.front();
		for(i=0;i<a[x].size();++i)
			if(c[a[x][i].nod]>c[x]+a[x][i].cost)
				c[a[x][i].nod]=c[x]+a[x][i].cost,q.push(a[x][i].nod);
			q.pop();
	}
}
int main()
{
	FILE *f=fopen("distante.in","r");
	fscanf(f,"%d",&t);
	while(t)
	{
		fscanf(f,"%d%d%d",&n,&m,&sursa);
		for(i=1;i<=n;++i)
		{
			fscanf(f,"%ld",&d[i]),val[i]=1<<30;
			a[i].clear();
		}
		for(i=1;i<=m;++i)
		{
			fscanf(f,"%d%d%d",&x,&y,&cost1);
			a[x].push_back((muchie) {y,cost1});
			a[y].push_back((muchie) {x,cost1});
		}
		det(sursa);
		ok=1;
		for(i=1;i<=n&&ok;++i)
			if(d[i]!=c[i])
				ok=0;
			if(ok)
				g<<"DA"<<"\n";
			else
				g<<"NU"<<"\n";
		--t;
	}
	return 0;
}