#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define N 50001
using namespace std;
int n, m, t, d[N], D[N], source;
vector< pair<int, int> > a[N];
int solve(){
	scanf("%d %d %d ", &n, &m, &source);
	for(int i = 1; i <= n; ++i)
		scanf("%d ", &D[i]);
    for(int i = 1; i <= m; ++i){
		int x, y, c;
        scanf("%d %d %d ", &x, &y, &c);
		if(x != y){
			a[x].push_back(make_pair(y, c));
			a[y].push_back(make_pair(x, c));
		}
	}
    queue<int> Q;
    Q.push(source);
    memset(d, 0x3f3f3f3f, sizeof(d));
    d[source] = 0;
    while(!Q.empty()){
        int x = Q.front();
        Q.pop();
        for(int i = 0; i < a[x].size(); ++i) {
            int y = a[x][i].first;
            int c = a[x][i].second;
            if(d[x] + c < d[y]) {
                d[y] = d[x] + c;
                Q.push(y);
            }
        }
    }
    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;
}