#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

const int NMax = 50005;
const int oo = (1 << 30);

int T, n, m, Start;
int D[NMax], viz[NMax], ans[NMax];

struct compDist
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }
};

vector < pair < int, int> > G[NMax];
priority_queue < int, vector < int >, compDist > Q;

void Citeste()
{
    fin >> n >> m >> Start;
    for(int i = 1; i <= n; i++)
        fin >> ans[i];
    for(int i = 1; i <= m; i++)
    {
        int x, y, cost;
        fin >> x >> y >> cost;
        G[x].push_back(make_pair(y, cost));
        G[y].push_back(make_pair(x, cost));
    }
}

void Dijkstra(int nodStart)
{
    for(int i = 1; i <= n; i++)
        D[i] = oo;
    D[nodStart] = 0;
    Q.push(nodStart);
    viz[nodStart] = 1;
    while(!Q.empty())
    {
        int nodCurent = Q.top();
        Q.pop();
        viz[nodCurent] = 0;
        for(size_t i = 0; i < G[nodCurent].size(); i++)
        {
            int Vecin = G[nodCurent][i].first;
            int Cost = G[nodCurent][i].second;
            if(D[nodCurent] + Cost < D[Vecin])
            {
                D[Vecin] = D[nodCurent] + Cost;
                if(viz[Vecin] == 0)
                {
                    Q.push(Vecin);
                    viz[Vecin] = 1;
                }
            }
        }
    }
}

void Afisare()
{
    for(int i = 1; i <= n; i++)
    {
        if(D[i] == oo) D[i] = 0;
        if(ans[i] != D[i])
        {
            fout << "NU\n";
            return;
        }
    }
    fout << "DA\n";
}

int main()
{
    fin >> T;
    for(int i = 1; i <= T; i++)
    {
        Citeste();
        Dijkstra(Start);
        Afisare();
    }
    return 0;
}