#include <bits/stdc++.h>
#define per pair<int , int>
#define f first
#define s second
using namespace std;
const int NMAX = 1e4 * 5 + 5;
int nodes , edges, root , ans[NMAX], Ans[NMAX];
vector <per> g[NMAX];
priority_queue <per , vector <per> , greater<per> > pq;
inline void dijkstra(int node)
{
    pq.push({0 , node});
    for (int i = 1; i<=nodes; Ans[i] = INT_MAX , ++i);
    Ans[node] = 0;
    while(!pq.empty())
    {
        per X = pq.top();
        pq.pop();
        if (X.f != Ans[X.s])continue;
        for (auto &it : g[X.s])
        {
            if (Ans[it.f] <= X.f + it.s)continue;
            Ans[it.f] = X.f + it.s;
            pq.push({Ans[it.f] , it.f});
        }
    }
}
int main()
{
    freopen("distante.in" ,"r", stdin);
    freopen("distante.out" ,"w", stdout);

    int Q;
    for (scanf("%d", &Q); Q; --Q)
    {
        //int nodes, edges, root;
        scanf("%d %d %d\n", &nodes , &edges, &root);
        for (int i = 1; i<=nodes; ++i)
            scanf("%d", &ans[i]);
        for (int i = 1; i<=edges; ++i)
        {
            int x , y, cost;
            scanf("%d %d %d\n", &x, &y, &cost);
            g[x].push_back({y , cost});
            g[y].push_back({x , cost});
        }
        dijkstra(root);
        bool ok = true;
        for (int i = 1; i<=nodes; ++i)
        {
            if (ans[i] != Ans[i]) ok = false;
            g[i].clear();
        }
        ok == true ? printf("DA\n") : printf("NU\n");

    }

    return 0;
}