#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int n,i,j,k,a,b,m,rez,T,cost[50005],s[50005],x,y;
bool ok=true;

int main()
{
	freopen("distante.in","r",stdin);
	freopen("distante.out","w",stdout);
	scanf("%d ",&T);
	for (i=1;i<=T;i++)
	{
		ok=true;
		memset(s,0,sizeof(s));
		scanf("%d %d %d",&n,&m,&x);
		j=1;
		for (j=1;j<=n;j++) scanf("%d",&s[j]);
		for (j=1;j<=m;j++) 
			{
				scanf("%d %d %d",&a,&b,&k);
				if (s[a]+k<s[b]) ok=false;
			}		
		if (ok) printf("DA\n");else printf("NU\n");
	}
	return 0;
}