#include <bits/stdc++.h>
#define din cin
#define dout out
#define pi 3.14159265359
#define sw(x,y) x^=y,y^=x,x^=y
#define bmin(a,b)((a<b)?(a):(b))
#define bmax(a,b)((a>b)?(a):(b))
#define ll long long
#define forq(i,ii,n)for(i=ii;i<n;i++)
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
ll n,m,i,j,k,d[50001],c[50001],t,s,z[50001];vector<pair<ll,ll>>a[50001];map<ll,bool>b;
int main()
{
in>>t;
while(t--)
{
fill(d,d+50001,0);fill(c,c+50001,LLONG_MAX);b.clear();
in>>n>>m>>s;
//cout<<"HERE";
for(i=1;i<=n;i++)in>>z[i];
while(m--)
    in>>i>>j>>k,a[i].push_back(make_pair(j,k)),a[j].push_back(make_pair(i,k));
b[1]=1,c[1]=1;
while(b.empty()==0)
{
    k=b.begin()->first;
    b.erase(b.begin());
    //cout<<(k&USHRT_MAX)<<' '<<(k>>16)<<'\n';
    d[k&65535]=k>>16;
    k&=65535;
    for(auto i=a[k].begin();i!=a[k].end();++i)
        {
            j=(((long long)(i->second+d[k]))<<16)+i->first;
            if(j<c[i->first])
                b.erase(c[i->first]),c[i->first]=j,b[c[i->first]]=1;
        }
}
if(equal(d+1,d+n+1,z+1))out<<"DA\n";
    else out<<"NU\n";
}
}