#include <bits/stdc++.h>
using namespace std;

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

int T;
int n, m, s;
int d[50005], d1[50005];
bitset<50005> viz;
vector<pair<int, int>> L[50005];
priority_queue<pair<int, int>> q;

void Dijkstra(int k)
{
    for (int i = 1; i <= n; i++)
        d[i] = 2e9;
    viz.reset();
    d[k] = 0;
    q.push({0, k});
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        if (!viz[k])
        {
            viz[k] = 1;
            for (auto e : L[k])
                if (d[e.second] > d[k] + e.first)
                {
                    d[e.second] = d[k] + e.first;
                    q.push({-d[e.second], e.second});
                }
        }
    }
}

int main()
{
    int t, i, j, c, same;
    fin >> T;
    for (int t = 1; t <= T; t++)
    {
        fin >> n >> m >> s;
        for (int i = 1; i <= n; i++)
            fin >> d1[i];
        while (m--)
        {
            fin >> i >> j >> c;
            L[i].push_back({c, j});
            L[j].push_back({c, i});
        }
        Dijkstra(s);
        same = 1;
        for (i = 1; i <= n && same; i++)
            same = (d[i] == d1[i]);
        if (same)fout << "DA\n";
        else fout << "NU\n";
    }
    return 0;
}