#include<cstdio>
#include<queue>
#include<vector>
#include<cstring>

using namespace std;

const int N = 50005;

int n, m, s, dist[N], l[N], t;
vector<pair<int, int> > v[N];
priority_queue<pair<int, int> > heap;

void citire() {
	scanf("%d%d%d", &n, &m, &s);
	
	for (int i = 1; i <= n; ++i)
		scanf("%d", &dist[i]);
	
	for (int i = 1; i <= m; ++i) {
		int x, y, c;
		scanf("%d%d%d", &x, &y, &c);
		
		v[x].push_back(make_pair(c, y));
		v[y].push_back(make_pair(c, x));
	}
}

void rez(int a) {
    heap.push(make_pair(0, a));

    while (!heap.empty()) {
        pair<int, int> nodc = heap.top();
        heap.pop();

        if (!l[nodc.second]) {
            l[nodc.second] = nodc.first;
            
            for (vector<pair<int, int> >::iterator it = v[nodc.second].begin(); it != v[nodc.second].end(); ++it)
                if (!l[it->second])
                    heap.push(make_pair(nodc.first - it->first, it->second));
        }
    }

    for (int i = 2; i <= n; ++i)
        l[i] *= (-1);
}

int main() {
	freopen("distante.in", "r", stdin);
	freopen("distante.out", "w", stdout);
	
	scanf("%d", &t);
	
	for (int i = 1; i <= t; ++i) {
		citire();
		
		rez(s);
		
		bool ok = true;
		
		for (int i = 1; i < s; ++i)
			if (l[i] != dist[i]) {
				ok = false;
				break;
			}
			
		for (int i = s + 1; i <= n; ++i)
			if (l[i] != dist[i]) {
				ok = false;
				break;
			}
		
		memset(l, 0, sizeof(l) );
		
		if (ok)
			printf("DA\n");
		else
			printf("NU\n");
	}
	
	return 0;
}