#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;

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

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

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

		if (D[S] != 0)
			ok = false;
		else {
			for (i = 0; i < M; ++i) {
				scanf("%d%d%d", &x, &y, &c);

				if (D[x] + c < D[y] || D[y] + c < D[x])
					ok = false;
			}
		}

		if (ok)
			printf("DA\n");
		else
			printf("NU\n");
	}

	return 0;
}