#include <iostream>
#include <fstream>
#include <vector>
#include <utility>
#include <queue>
#define NMAX 50000
using namespace std;

ifstream fin("distante.in");
ofstream fout("distante.out");

vector <pair <int,int>> g[NMAX];
int n,m,s,v[NMAX];

bool Dijkstra()
{
    int vis[NMAX]={0},dist[NMAX];
    dist[s]=0;
    priority_queue <pair <int,int>> pq;
    pq.push(make_pair(0,s));
    while(!pq.empty())
    {
        pair <int ,int> top=pq.top();
        pq.pop();
        if(vis[top.second]==1)
            continue;
        vis[top.second]=1;
        dist[top.second]=-top.first;
        for(auto x:g[top.second])
        {
            if(vis[x.first]==0)
            {
                pq.push(make_pair(-(-top.first+x.second),x.first));
            }
        }
    }

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

int main() {

    int t;
    fin>>t;
    while(t--)
    {
    fin>>n>>m>>s;
    for(int i=1;i<=n;++i)
        fin>>v[i];
    for(int i=1;i<=n;++i)
        g[i].clear();
    while(m--)
    {
        int u,v,w;
        fin>>u>>v>>w;
        g[u].push_back(make_pair(v,w));
        g[v].push_back(make_pair(u,w));
    }

    if(Dijkstra())
        fout<<"DA\n";
    else fout<<"NU\n";
    }

	return 0;
}