#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
priority_queue<pair<int,int> , vector<pair<int, int> > , greater<pair<int,int> > > q;
vector<pair<int, int > > v[50004];
int i,n,d[50004],m,sol[50004],t,shp,s,ok,a,b,c,u,x;
int main()
{
    ifstream cin("distante.in");
    ofstream cout("distante.out");
    cin>>t;
    for(shp=1;shp<=t;shp++)
    {
        cin>>n>>m>>s;
        for(i=1;i<=n;i++)
        {
            cin>>d[i];
        }
        ok=0;
        for(i=1;i<=m;i++)
        {
           cin>>a>>b>>c;
           if(d[a]+c<d[b]||d[b]+c<d[a])
               ok=1;

        }
        if(d[s]!=0)
            ok=1;
     
        if(ok==0)
            cout<<"DA\n";
        else cout<<"NU\n";
    }
    return 0;
}