#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m,v[50003],vizitat[50003],nod,cost[50003];
vector < pair <int,int> > graf[50003];
priority_queue < pair <int,int>, vector < pair <int,int> >,greater < pair <int,int> > > chestie;
void dijkstra () {
	while(chestie.size()!=0) {
		nod=chestie.top().second;vizitat[nod]=1;chestie.pop();
		for(int i=0;i<(int)graf[nod].size();++i)
			if(vizitat[graf[nod][i].first]==0 && cost[graf[nod][i].first]>cost[nod]+graf[nod][i].second) {
				cost[graf[nod][i].first]=cost[nod]+graf[nod][i].second;
				chestie.push(make_pair(cost[graf[nod][i].first],graf[nod][i].first));
			}
	}
}
int main () {
	int t,nr1,nr2,nr3,nod1;bool ok;
	freopen("distante.in","r",stdin);
	freopen("distante.out","w",stdout);
	scanf("%d", &t);++t;
	while(--t) {
		scanf("%d%d%d", &n, &m, &nod1);
		for(int i=1;i<=n;++i)
			scanf("%d", &v[i]);
		for(int i=1;i<=m;++i) {
			scanf("%d%d%d", &nr1, &nr2, &nr3);
			graf[nr1].push_back(make_pair(nr2,nr3));
			graf[nr2].push_back(make_pair(nr1,nr3));
		}
		cost[nod1]=0;
		for(int i=1;i<=n;++i)
			if(i!=nod1)
				cost[i]=1e9;
		chestie.push(make_pair(0,nod1));
		dijkstra();ok=true;
		for(int i=1;i<=n;++i)
			if(cost[i]!=v[i]){
				ok=false;printf("NU\n");
				break;
			}
		if(ok==true)
			printf("DA\n");
		for(int i=1;i<=n;++i)
			cost[i]=0,vizitat[i]=0,graf[i].clear();
	}
	return 0;
}