#include<fstream>
#include<vector>
#include<queue>
#define inf 0x3f3f3f
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
vector<vector<int> >A(50001);
vector<vector<int> >c(50001);
vector<int> dist(50001,inf);
vector<int> dist1(50001);
queue<int> q;
int n,m,x,y,cc,t,s;
int xx,i,j,ok=0;
inline void solvation()
{
	while(t)
	{
		ok=0;
		f>>n>>m>>s;
		for(i=1;i<=n;++i)
		{
			dist[i]=inf;
			A[i].clear();
			c[i].clear();
		}
		for(i=1;i<=n;++i)
			f>>dist1[i];
		for(;m;--m)
		{
			f>>x>>y>>cc;
			A[x].push_back(y);
			A[y].push_back(x);
			c[x].push_back(cc);
			c[y].push_back(cc);
		}
		q.push(s);
		dist[s]=0;
		while(!q.empty())
		{
			xx=q.front();
			for(i=0;i<A[xx].size();++i)
				if(dist[xx]+c[xx][i]<dist[A[xx][i]])
				{
					q.push(A[xx][i]);
					dist[A[xx][i]]=dist[xx]+c[xx][i];
				}
			q.pop();
		}
		for(i=1;i<=n;++i)
			if(dist[i]!=dist1[i])
			{
				ok=1;
				break;
			}
			if(!ok)
				g<<"DA\n";
			else
				g<<"NU\n";
		--t;
	}
}
int main()
{
	f>>t;
	solvation();
	return 0;
}