#include <bits/stdc++.h>

using namespace std;

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


class cmp
{
    public:
    bool operator ()(pair <int, int> &a, pair<int, int> &b)
    {
        return a.second>b.second;
    }
};
priority_queue < pair <int, int>, vector <pair<int, int> >, cmp> pq;
int n, p, m;
vector <pair <int, int> > graf[100001];
int dist[100001];
void initializare(int p)
{
    int i;
    for (i = 1; i<=n; ++i)
        if (i!=p) dist[i] = 2000000000;
}

queue <int>bee;
int y, i, j, x, nod, cost, d,s;
int main()
{
    f>>s;
    for(i=1;i<=s;i++)
    {

    f >> n >> m >> p;
    for(j=1;j<=n;j++)
        {
             f>>x;
             bee.push(x);
            // g<<bee.back();
        }
    initializare(p);

    for (i = 0; i<m; ++i)
    {
        f >> x >> y >> d;
        graf[x].push_back (make_pair(y, d));
        graf[y].push_back (make_pair(x, d));
    }
    pq.push(make_pair(p, dist[p]));
    while (pq.size())
    {
        nod = pq.top().first;
        cost = pq.top().second;
        pq.pop();
        if (dist[nod] != cost)
            continue;
        for(int i = 0; i != graf.size(); ++i)
        {
            if (cost + graf[i].second < dist[graf[i].first])
            {
                dist[graf[i].first] = cost+graf[i].second;
                pq.push(make_pair(graf[i].first, dist[graf[i].first]));
            }
        }
    }
    int ok=0;
    for (i = 1; i<=n&&!ok; ++i)
        {if (dist[i] != bee.front())
ok=1;
bee.pop();
        }
        if(ok)
            g<<"NU"<<endl;
        else
            g<<"DA"<<endl;
        }
    return 0;
}