#include<fstream>
#include<queue>
#include<vector>
#define maxn 100001
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
queue <long long> q;
vector <long long> G[maxn], C[maxn];
long long i,n,m,x,y,c,d[maxn],cor[50001],t,s,ver1,ciclu[maxn];
int bellmanfordBFS(int x0)
{
    for(int i=1; i<=n; ++i)

        d[i] = INF;
    d[x0] = 0;
    q.push(x0);
    while(!q.empty()){
        int x = q.front();
        ciclu[x]++;
        if(ciclu[x] > n){
            return -1;
        }
        for(int i=0; i<G[x].size(); ++i)
            if(d[G[x][i]] > d[x] + C[x][i]) {
                d[G[x][i]] = d[x] + C[x][i];
                q.push(G[x][i]);
            }
        q.pop();
    }
    return 1;
}
int main()
{
    f>>ver1;
    for(int ver=1;ver<=ver1;ver++)
    {
    f>>n>>m>>s;
    for(i=1;i<=n;i++)
    {
        f>>cor[i];
    }
    for(int i = 1; i <= m; i++){
        f>>x>>y>>c;
        G[x].push_back( y );
        C[x].push_back( c );
    }

    int c = bellmanfordBFS(1);
   int veri=1;
    if(c > 0){
        for(int i = 1; i <= n; i++){
           if(cor[i]!=d[i])
           {
               veri=0;
               break;
           }
        }
        if(!veri)
            g<<"NU"<<"\n";
        else
            g<<"DA"<<"\n";
    }
    else
        g<<"NU"<<"\n";
    }
    return 0;
}