#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define n1 first
#define c1 second

using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int t,sol[50000],sol1[50000],n,m,k,a,b,c;
bool ok;
int main()
{
    f>>t;
    for(int i=1; i<=t; i++)
    {
        f>>n>>m>>k;
        for(int j=1; j<=n; j++)
            f>>sol1[j];
        ok=true;
        if(sol1[k]!=0)ok=false;
        for(int j=1; j<=m; j++)
        {
            f>>a>>b>>c;
            if(sol1[a]>sol1[b]+c||sol1[b]>sol1[a]+c)ok=false;
        }
        if(ok==false)g<<"NU\n";
            else g<<"DA\n";

    }

    return 0;
}