#include <cstdio>
#include <iostream>
#include <array>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <stack>
#define MOD 1000000007
#define NMAX 50005
#define MMAX 100005
#define INF 100000000
#define mp make_pair

using namespace std;

FILE *fin = freopen("distante.in", "r", stdin);
FILE *fout = freopen("distante.out", "w", stdout);

typedef pair<int, int> pii;

vector<pii> v[NMAX];
int D[NMAX];
bool viz[NMAX];
int N, M, S;

void verifica();

int main() {
	int i, j, x, y, c, T;

	scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d", &N, &M, &S);

		for (i = 1; i <= N; ++i)
			scanf("%d", &D[i]);

		for (i = 0; i < M; ++i) {
			scanf("%d%d%d", &x, &y, &c);

			v[x].push_back(mp(c, y));
			v[y].push_back(mp(c, x));
		}

		verifica();
	}

	return 0;
}

void verifica() {
	if (D[S] != 0) {
		printf("NU\n");
		return;
	}

	int x, y, i, c;
	bool ok;
	queue<int> Q;
	Q.push(S);
	viz[S] = true;

	while (!Q.empty()) {
		x = Q.front();
		Q.pop();
		
		ok = true;
		if (x != S) {
			ok = false;

			for (i = 0; i < v[x].size(); ++i) {
				y = v[x][i].second;
				c = v[x][i].first;

				if (viz[y] && D[y] + c == D[x]) {
					ok = true;
					break;
				}
			}
		}
		
		if (ok == false) {
			printf("NU\n");
			return;
		}

		for (i = 0; i < v[x].size(); ++i) {
			y = v[x][i].second;
			c = v[x][i].first;

			if (D[x] + c < D[y]) {
				printf("NU\n");
				return;
			}
			else if(!viz[y]) {
				viz[y] = true;
				Q.push(y);
			}
		}
	}

	printf("DA\n");
}