#include<queue>
#include<vector>
#include<fstream>
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
const int N=50200;
const int INF=10000000;
vector<int>a[N],c[N];
bool inc[N];
int n,m,start,e[N];
void read()
{
	int x,y,z;
	in>>n>>m>>start;
	for(int i=1;i<=n;i++)
		if(i!=start)
			in>>e[i];
	for(int i=1;i<=m;i++)
	{
		in>>x>>y>>z;
		a[x].push_back(y);
		c[x].push_back(z);
	}
}

int d[N],q[N];
queue<int>coada;
void bf(int s)
{
//	bool bn=1;
	for(int i=1;i<=n;i++)
		d[i]=INF;
	int x,cost,r;
	d[s]=0;
	coada.push(s);
	inc[1] = true;
	while(!coada.empty())
	{
		r=coada.front();
		coada.pop();
		inc[r] = false;
		unsigned int du=a[r].size();
		for(int i=0;i<du;i++)
		{
			x = a[r][i];
			cost = c[r][i];
			if(d[r]+cost < d[x])
			{
				d[x] = d[r]+cost;
				if(!inc[x])
				{
					inc[x] = true;
					q[x]++;
					//if(q[x]>n-1)
						//bn=false;
					coada.push(x);
				}
			}
		}
	}
	//return bn;
}
bool ha()
{
	for(int i=1;i<=n;i++)
			if(i!=start)
				if((d[i]!=INF && d[i]!=e[i]) || ( !d[i] && e[i]!=0))
					return 0;
	return 1;
}

int main()
{
	int t;
	in>>t;
	for(int i=1;i<=t;++i)
	{
		read();
		bf(start);
		if(ha())
			out<<"DA\n";
		else
			out<<"NU\n";
	}
	return 0;
}