#include<fstream>
#include<vector>
#include<queue>
using namespace std;
int T,n,m,x0,d[50010],v[50010];

struct Much
{
    int nod,cost;
};


vector <Much> G[50010];

void Bellman_Ford()
{
	int i;
	for(i=1;i<=n;i++)
		d[i]=2000000000;
	queue <int> Q;
	int x,nod,c;
	Q.push(x0);
	d[x0]=0;
	while(!Q.empty())
	{
		x=Q.front();
		Q.pop();
		for(i=0;i<G[x].size();i++)
		{
			nod=G[x][i].nod;
			c=G[x][i].cost;
			if(d[nod]>d[x]+c)
			{
				d[nod]=d[x]+c;
				Q.push(nod);
			}
		}
	}
}

bool Verificare()
{
	int i;
	for(i=1;i<=n;i++)
		if(d[i]!=v[i])
			return false;
	return true;
}

int main()
{
	int t,i,x,y,c;
	Much aux;
	bool ok;
	ifstream f("distante.in");
	ofstream g("distante.out");
	f>>T;
	for(t=0;t<T;t++)
	{
		f>>n>>m>>x0;
		for(i=1;i<=n;i++)
			f>>v[i];
		for(i=1;i<=m;i++)
		{
			f>>x>>y>>c;
			aux.nod=y; aux.cost=c;
			G[x].push_back(aux);
			aux.nod=x;
			G[y].push_back(aux);
		}
		Bellman_Ford();
		ok=Verificare();
		if(ok)
			g<<"DA\n";
		else
			g<<"NU\n";
		for(i=1;i<=n;i++)
			G[i].clear();
	}
	f.close();
	g.close();
	return 0;
}