#include<cstdio>
#include<vector>
#include<bitset>
#include<queue>
#include<utility>
using namespace std;

int t,n,m,s,x,y,c,i,inf=1<<30,d[50010],D[50010];
bitset<50010> q;
queue<int> Q;
vector<pair<int,int> > V[50010];
void read(),solve();

int main()
{
	read();
	solve();
	
	return 0;
}

void read()
{
	freopen("distante.in","r",stdin);
	freopen("distante.out","w",stdout);
	scanf("%d",&t);
}

void solve()
{
	for(;t--;)
	{
		scanf("%d%d%d",&n,&m,&s);
		//Q.clear();
		for(i=1;i<=n;i++)
		{
			scanf("%d",&d[i]);
			D[i]=inf;
			q[i]=0;
			V[i].clear();
		}
		for(i=1;i<=m;i++)
		{
			scanf("%d%d%d",&x,&y,&c);
			V[x].push_back(make_pair(y,c));
			V[y].push_back(make_pair(x,c));
		}
		D[s]=0;Q.push(s);q[s]=1;
		for(;Q.size();)
		{
			x=Q.front();
			for(vector<pair<int,int> >::iterator it=V[x].begin();it!=V[x].end();it++)
			{
				y=it->first;
				c=it->second;
				if(D[y]>D[x]+c)
				{
					D[y]=D[x]+c;
					if(!q[y])Q.push(y);
				}
			}
			Q.pop();
			q[x]=0;
		}
		int ok=0;
		for(i=1;i<=n;i++)
			if(d[i]!=D[i]){ok=1;break;}
		if(ok)printf("NU\n");
		else  printf("DA\n");
	}
}