#include <cstdio>
#include <cstring>
#define inf 0x3f3f3f
#define N 50001
int n, m, t, source, d[N], D[N], C[5001][5001], T[N];
bool u[N];
int solve(){
	scanf("%d %d %d ", &n, &m, &source);
	memset(C, inf, sizeof(C));
	memset(D, inf, sizeof(D));
	for(int i = 1; i <= n; ++i)
		C[i][i] = 0;
	for(int i = 1; i <= n; ++i)
		scanf("%d ", &d[i]);
	for(int i = 1; i <= m; ++i){
		int p, q, c;
		scanf("%d %d %d ", &p, &q, &c);
		C[p][q] =  C[q][p] = c;
	}
	D[source] = 0;
	while(1){
		int mini = inf, nod = -1;
		for(int i = 1; i <= n; ++i)
			if(!u[i] && mini > D[i])
				mini = D[i],
				nod = i;
		if(mini == inf)
			break;
		u[nod] = true;
		for(int i = 1; i <= n; ++i)
			if(D[i] > D[nod] + C[nod][i])
				D[i] = D[nod] + C[nod][i],
				T[i] = nod;
	}
	for(int i = 1; i <= n; ++i)
		if(d[i] != D[i])
			return false;
	return true;
}
int main(){
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    scanf("%d\n", &t);
    for(int i = 1; i <= t; ++i)
		printf("%s\n", solve() == true ? "DA" : "NU");
    return 0;
}