#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long 
#define ull unsigned long long 
#define nmax 100005
#define MOD 666013 
#define INF 2123456789
//#define fin cin 
//#define fout cout 

ifstream fin("distante.in");
ofstream fout("distante.out");

int n, m, start;
int distMin[nmax];
vector <pair <int, int>> L[nmax];
priority_queue <pair <int, int>> pq;
bitset <nmax> viz;
int d[nmax];

bool Check()
{
	int i;
	for (i = 1; i <= n; i++)
		if (d[i] != distMin[i])
			return 0;
	return 1;
}

void ReInit()
{
	for (int i = 1; i <= n; i++)
	{
		d[i] = INF;
		L[i].clear();
	}
	pq = priority_queue <pair <int, int>> ();
	viz.reset();
}

void Dijkstra(int p)
{
	int i, k, cost;
	d[p] = 0;
	pq.push({ 0, p });
	while (!pq.empty())
	{
		k = pq.top().second;
		pq.pop();
		if (!viz[k])
		{
			viz[k] = 1;
			for (auto e : L[k])
			{
				i = e.second;
				cost = e.first;
				if (d[i] > d[k] + cost)
				{
					d[i] = d[k] + cost;
					pq.push({ -d[i], i });
				}
			}
		}
	}
}

void Taskul()
{
	int i, j, c;
	fin >> n >> m >> start;
	for (i = 1; i <= n; i++)
		fin >> distMin[i];
	ReInit();
	for (int q = 1; q <= m; q++)
	{
		fin >> i >> j >> c;
		L[i].push_back({ c, j });
		L[j].push_back({ c, i });
	}
	Dijkstra(start);
	if (Check())
		fout << "DA\n";
	else
		fout << "NU\n";
}

int main()
{
	int ts;
	fin >> ts;
	while (ts--)
		Taskul();
	fin.close();
	fout.close();
	return 0;
}