#include<fstream>
#include<vector>
#include<set>
#define Nmax 50001
#define INF 1000001
using namespace std;
vector< pair<int, int> > G[Nmax];
int n, m, i, j, viz[Nmax], d[Nmax], T, dist[Nmax];
set < pair<int,int> > S;
set< pair<int, int> > :: iterator it;
void dijkstra()
{
	int cost, vf, i;
	while(!S.empty())
	{
		it = S.begin();
		cost= (*it).first;
		vf = (*it).second;
		viz[vf]=1;
		S.erase( make_pair(cost, vf));
		for(i=0;i<G[vf].size();i++)
			if(!viz[G[vf][i].first] && d[G[vf][i].first]>cost+G[vf][i].second)
			{
				d[G[vf][i].first]=cost+G[vf][i].second;
				S.insert( make_pair(d[G[vf][i].first], G[vf][i].first));
			}
	}
}
int main()
{
	int a, b, c, j, start;
	freopen("distante.in", "r", stdin);
	freopen("distante.out", "w", stdout);
	scanf("%d", &T);
	for(j=1;j<=T;j++)
	{
		scanf("%d%d%d", &n, &m, &start);
		for(i=1;i<=n;i++)
		{
			scanf("%d", &dist[i]);
			d[i]=0;
		}
		for(i=1;i<=m;i++)
		{
			scanf("%d%d%d", &a, &b, &c);
			G[a].push_back(make_pair(b, c));
			G[b].push_back(make_pair(a, c));
		}
		for(i=0;i<G[start].size();i++)
		{
			d[G[start][i].first]=G[start][i].second;
			S.insert(make_pair(G[start][i].second, G[start][i].first));
		}
	
		for(i=1;i<=n;i++)
		{
			if(d[i]==0)
				d[i]=INF;
			viz[i]=0;
		}
		viz[start]=1;
		dijkstra();
		d[start]=0;
		int ok=1;
		for(i=1;i<=n&&ok;i++)
			if(d[i]!=dist[i])
				ok=0;
		if(ok)
			printf("DA\n");
		else
			printf("NU\n");
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}