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

vector < pair <int, int> > A[50100];
int t, n, m, s, cost[50100], X, Y;
int main()
{
    ifstream f("distante.in");
    ofstream g("distante.out");

    for (f >> t; t > 0; --t)
    {
        f >> n >> m >> s;
        for (int i = 1; i <= n; ++i)
            f >> cost[i];

        for (int i = 1; i <= 50000; ++i)
            while (A[i].size() > 0) A[i].pop_back();

        for (int i = 1; i <= m; ++i)
        {
            int c;
            f >> X >> Y >> c;
            A[X].push_back(make_pair(Y, c));
            A[Y].push_back(make_pair(X, c));
        }

        int ok = 1, nr = 0;
        for (int i = 1; i <= n; ++i)
        {
            for (vector < pair <int, int> > :: iterator it = A[i].begin(); it != A[i].end(); ++it)
                if (cost[it -> first] + it -> second < cost[i])
                {
                    ok = 0;
                    break ;
                }
                else
                if (cost[it -> first] + it -> second == cost[i])
                    nr = 1;
        }

        if (nr && ok) g << "DA\n";
        else
        g << "NU\n";
    }

    g.close();
    return 0;
}