#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

using VI = vector<int>;
using PI = pair<int, int>;
using VP = vector<PI>;

const int Inf = 0x3f3f3f3f;
int T, n, m, s;
vector<VP> G;
VI d, v;
bool ok;

void ReadGraph();
void Dijkstra(int x, VI& d);

int main()
{
    for (fin >> T; T; T--)
    {
        ReadGraph();
        Dijkstra(s, d);
        ok = true;
        for (int i = 1; i <= n; i++)
            if (d[i] != v[i])
            {
                ok = false;
                break;
            }
        if (ok)
            fout << "DA\n";
        else
            fout << "NU\n";
    }

    fin.close();
    fout.close();
}

void Dijkstra(int x, VI& d)
{
    priority_queue<PI, VP, greater<PI>> Q;
    d = VI(n + 1, Inf);
    d[x] = 0;
    Q.push({0, x});
    int y, dx, w;
    while (!Q.empty())
    {
        x = Q.top().second;
        dx = Q.top().first;
        Q.pop();
        if (dx > d[x])
            continue;
        for (const auto& p : G[x])
        {
            y = p.first;
            w = p.second;
            if (d[y] > d[x] + w)
            {
                d[y] = d[x] + w;
                Q.push({d[y], y});
            }
        }
    }
}

void ReadGraph()
{
    fin >> n >> m >> s;
    G = vector<VP>(n + 1);
    v = VI(n + 1);
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    int x, y, w;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y >> w;
        G[x].push_back({y, w});
        G[y].push_back({x, w});
    }
}