#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <sstream>
using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");

int t,n,m;
vector<pair<int,int>> weighted_adjacency_list[50001];

vector<int> Dijkstra(const int start_node, const int inf)
{
    int nod_crt, d;
    vector<int> distance(n+1, inf);
    distance[start_node] = 0;

    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>> > min_dist_node;
    min_dist_node.push(make_pair(distance[start_node], start_node));

    while(min_dist_node.empty() == false)
    {
        d = min_dist_node.top().first;
        nod_crt = min_dist_node.top().second;
        min_dist_node.pop();

        if(d == distance[nod_crt])
        {
            for(auto edge:weighted_adjacency_list[nod_crt])
            {
                if(d + edge.first < distance[edge.second])
                {
                    distance[edge.second] =  d + edge.first;
                    min_dist_node.push(make_pair(distance[edge.second], edge.second));
                }
            }
        }
    }
    return distance;
}



int main()
{
    int a,b,c,s;
    f>>t;
    while(t)
    {
        --t;
        f>>n>>m>>s;

        vector<int> v1(n+1);
        for(int i=1;i<=n;++i)
            f>>v1[i];

        for(int i=1;i<=m;++i)
        {
            f>>a>>b>>c;
            weighted_adjacency_list[a].push_back({c,b});
            weighted_adjacency_list[b].push_back({c,a});
        }

        vector<int> v2 = Dijkstra(s , 0x1fffffff);

        bool ok=true;
        for(int i=1;i<=n;++i)
            if(v1[i]!=v2[i])
            {
                g<<"NU\n";
                ok=false;
                i=n+1;
            }
        if(ok)
            g<<"DA\n";
        for(int i=1;i<=n;++i)
            weighted_adjacency_list[i].clear();
    }

    return 0;
}