// by Alex Prohnitchi
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const ll mod=1e9+7;
const ll INF=2e9;
const int inff=2e7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int N=50002;

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r){return uniform_int_distribution<int>(l,r)(rng);}

ifstream fin("distante.in");
ofstream fout("distante.out");

ll t,n;

vector<pii>v[N];
int rasp[N],cost[N],viz[N],d[N];

void solve() {
	int n,m,s;
	fin >> n >> m >> s;
	int a,b,c;
	for (int i=1; i<=n; i++) {
		fin >> d[i];
		v[i].clear();
	}
	for (int i=1; i<=m; i++) {
		fin >> a >> b >> c;
		v[a].pb({b,c});
		v[b].pb({a,c});
	}
	for (int i=1; i<=n; i++) {
		cost[i]=inff;
		viz[i]=0;
	}
	cost[s]=0;
	priority_queue<pair<int,int>>q;
	q.push({s,0});
	
	while(!q.empty()) {
		int nod=q.top().fr;
		viz[nod]=1;
		for (auto it:v[nod]) {
			int next=it.fr,cs=it.sc;
			if (!viz[next]) {
				q.push({next,cs});
			}
			cost[next]=min(cost[next],cost[nod]+cs);
		}
		q.pop();
	}
	
	for (int i=1; i<=n; i++) {
		if (cost[i]!=d[i]) {
			fout << "NU\n";
			return;
		}
	}
	fout << "DA\n";
	return;
	
}

int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	t=1;
	cin >> t;
	while (t--) {
		solve();
	}

}