#include<stdio.h>
#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()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&t);
    for(shp=1;shp<=t;shp++)
    {
        scanf("%d%d%d",&n,&m,&s);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&sol[i]);
            d[i]=inf;
            v[i].clear();
        }
        for(i=1;i<=m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            v[a].push_back(make_pair(b,c));
            v[b].push_back(make_pair(a,c)); 
        }
        d[s]=0;
        q.push(make_pair(0,s));
        while(!q.empty())
        {
            c=q.top().first;
            x=q.top().second;
            q.pop();
            for(vector<pair<int,int> > :: iterator it=v[x].begin();it!=v[x].end();it++)
            {
                if(d[it->first]>c+it->second)
                {
                    d[it->first]=c+it->second;
                    q.push(make_pair(d[it->first],it->first));
                }

            }
        }
        ok=0;
        for(i=1;i<=n;i++)
        {
            if(d[i]==sol[i]||(d[i]==inf && sol[i]==0))
                continue;
            ok=1;
        }
        if(ok==0)
            printf("DA\n");
        else printf("NU\n");

    }
    return 0;
}