#include <fstream>
#include <vector>
#include <set>

using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");

int main() {

	int numar_grafuri, n, m, s;
	f >> numar_grafuri;

	
	for (int j = 0; j < numar_grafuri; j++) {

		f >> n >> m >> s;
		vector <int> viz(n + 1, 0);
		vector <int> dist(n + 1, 1002);
		vector <int> dist_precalculat(n + 1, 0);
		vector < vector< pair<int, int>>> G(n + 1);
		set <pair<int, int>> S;


		for (int i = 1; i <= n; i++)
			f >> dist_precalculat[i];

		for (int i = 0; i < m; i++) {
			int x, y, cost;
			f >> x >> y >> cost;
			G[x].push_back(make_pair(cost, y));
			G[y].push_back(make_pair(cost, x));
		}

		S.insert({ 0, s });
		dist[s] = 0;
		viz[s] = 1;

		while (!S.empty()) {
			int nodCurent = (*S.begin()).second;
			S.erase(S.begin());

			for (auto nod : G[nodCurent]) {
				if (dist[nodCurent] + nod.first < dist[nod.second]) {
					//S.erase({ dist[nod.second], nod.second });
					dist[nod.second] = dist[nodCurent] + nod.first;
					S.insert({ dist[nod.second], nod.second });
				}
			}
		}

		int nr = 0;
		for (int i = 1; i <= n; i++)
			if (dist[i] == dist_precalculat[i]) nr++;
		if (nr == n) g << "DA\n";
		else g << "NU\n";

		S.clear();
	}
	return 0;
}