#include <fstream>
#include <vector>
#include <queue>
#include <deque>

#define NMAX 50001

using namespace std;

int dist[NMAX];

int main()
{
    int n, m;
    int i;
    int t;
    int s;
    int a, b, c;
    bool result;
    ifstream f("distante.in");
    ofstream g("distante.out");
    f >> t;
    for(int ii = 0; ii < t; ii++)
    {
        result = true;
        f >> n >> m >> s;
        for(i = 1; i <= n; i++)
            f >> dist[i];
        for(i = 0; i < m; i++)
        {
            f >> a >> b >> c;
            if(dist[a] + c < dist[b])
                result = false;
            if(dist[b] + c < dist[a])
                result = false;
        }
        if(result)
            g << "DA\n";
        else
            g << "NU\n";
    }
    f.close();
    g.close();
    return 0;
}