#include<bits/stdc++.h>
using namespace std;
const int N=50050, INF=999999999;
int main(){
	ifstream f("distante.in");
	ofstream g("distante.out");
	int t;
	f>>t;
	while(t--){
		int n, m, s;
		f>>n>>m>>s;
		bool v[N];
		int d[N], d1[N];
		for(int i=1;i<=n;i++){
			f>>d1[i];
			d[i]=INF;
			v[i]=0;
		}
		vector <pair<int,int> > mda[N];
		while(m--){
			int x, y, z;
			f>>x>>y>>z;
			mda[x].push_back({y,z});
			mda[y].push_back({x,z});
		}
		d[s]=0;
		priority_queue <pair<int, int> > h;
		h.push({0,s});
		vector<pair<int, int> > :: iterator it;
		while(!h.empty()){
			int nod=h.top().second;
			h.pop();
			if(v[nod])continue; else v[nod]=1;
			int l=mda[nod].size();
			for(int i=0;i<l;i++){
				int y=mda[nod][i].first, cost=mda[nod][i].second;
				if(d[y]>d[nod]+cost){
					d[y]=d[nod]+cost;
					h.push({-d[y],y});
				}
			}
		}
		int i;
		for(i=1;i<=n && d[i]==d1[i]; i++);
		if(i==n+1) g<<"DA\n"; else g<<"NU\n";
	}
}