#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
vector <pair <int,int> >g[12][50002];
priority_queue <pair <int,int> >heap;
int n,dist[12][50002],pp[50002];
void dijkstra(int start,int h)
{
    int node,cost,son,costs,i,l;
    for(i=1;i<=n;i++)
        dist[h][i]=2000000000;
    dist[h][start]=0;
    heap.push({0,start});
    while(!heap.empty())
    {
        node=heap.top().second;
        cost=-heap.top().first;
        l=g[h][node].size();
        heap.pop();
        if(cost<=dist[h][node])
            for(i=0;i<l;i++)
        {
            son=g[h][node][i].second;
            costs=g[h][node][i].first;
            if(dist[h][son]>cost+costs)
            {
                dist[h][son]=cost+costs;
                heap.push({-dist[h][son],son});
            }
        }
    }
}
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    int t,m,h,start,i,a,b,c,ok;
   scanf("%d",&t);
   for(h=1;h<=t;h++)
   {
       ok=1;
       scanf("%d%d%d",&n,&m,&start);
       for(i=1;i<=n;i++)
        scanf("%d",&pp[i]);
       for(i=1;i<=m;i++)
       {
           scanf("%d%d%d",&a,&b,&c);
           g[h][a].push_back({c,b});
           g[h][b].push_back({c,a});
       }
       dijkstra(start,h);
       for(i=1;i<=n;i++)
        if(pp[i]!=dist[h][i])
            ok=0;
        if(!ok)
            printf("NU\n");
        else printf("DA\n");
   }
    return 0;
}