#include <bits/stdc++.h>

using namespace std;

const int nmax=50005;
const int lim=100000000;

vector <pair <int, int> > graph[nmax];
priority_queue <pair <int, int>, vector <pair <int, int> >, greater <pair <int, int> > > heap;
int dist[nmax];
int rasp[nmax];

void dijkstra(int start_node, int n)
{
    for(int i=1;i<=n;i++)
        dist[i]=lim;
    dist[start_node]=0;
    heap.push(make_pair(0, start_node));
    while(heap.size()>0)
    {
        int nod=heap.top().second;
        int cost=heap.top().first;
        heap.pop();
        if(cost<=dist[nod])
        {
            for(int i=0;i<graph[nod].size();i++)
            {
                int nod_l=graph[nod][i].first;
                int cost_l=graph[nod][i].second;
                if(dist[nod_l]>cost+cost_l)
                {
                    dist[nod_l]=cost+cost_l;
                    heap.push(make_pair(dist[nod_l], nod_l));
                }
            }
        }
    }
}

int main()
{
    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);
    int t;

    scanf("%d", &t);
    while(t)
    {
        int n, m, s;
        scanf("%d%d%d", &n, &m, &s);
        for(int i=1;i<=n;i++)
        {
            int x;
            scanf("%d", &x);
            rasp[i]=x;
        }
        for(int i=1;i<=m;i++)
        {
            int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            graph[a].push_back(make_pair(b, c));
            graph[b].push_back(make_pair(a, c));
        }
        dijkstra(s, n);
        bool cnt=true;
        for(int i=1;i<=n;i++)
        {
            if(rasp[i]!=dist[i])
            {
                cnt=false;
                break;
            }
        }
        if(cnt==true)
            printf("DA\n");
        else
            printf("NU\n");
        t--;
    }

    return 0;
}