#include<bits/stdc++.h>
#define maxN 50005
#define INF INT_MAX
using namespace std;
int dp[maxN],n,m,s,sol[maxN],t,x,y,c;
vector<pair<int,int> > v[maxN];
typedef struct edge
{
  int nod,cost;
  bool operator<(const edge& other) const
  {
      return cost>other.cost;
  }
};
priority_queue<edge> q;
void Dijkstra()
{
    while(!q.empty())
    {
        int x=q.top().nod;
        int y=q.top().cost;
        q.pop();
        if(dp[x]<y) continue;
        for(vector<pair<int,int> >::iterator it=v[x].begin();it!=v[x].end();it++)
        {
            int sum=y+(*it).second;
            if(sum<dp[(*it).first])
            {
                dp[(*it).first]=sum;
                q.push({(*it).first,dp[(*it).first]});
            }
        }
    }
}
void Check()
{
    for(int i=1;i<=n;i++) if(dp[i]!=sol[i])
    {
        printf("NU\n");
        return;
    }
    printf("DA\n");
}
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&t);
    for(int test=1;test<=t;test++)
    {
        scanf("%d%d%d",&n,&m,&s);
        for(int i=1;i<=n;i++) scanf("%d",&sol[i]);
        for(int i=1;i<=n;i++) dp[i]=INF;
        dp[s]=0;
        q.push({s,0});
                for(int i=1;i<=n;i++) v[i].clear();
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d%d",&x,&y,&c);
            v[x].push_back(make_pair(y,c));
            v[y].push_back(make_pair(x,c));
        }

        Dijkstra();
        Check();
    }
    return 0;
}