#include<queue>
#include<cstdio>
#include<vector>
using namespace std;
int cost[50001],dist[50001];
class Compare
{
  public:
    bool operator()(const int &x, const int &y)
      {
        return cost[x]>cost[y];
      }
};
priority_queue <int, vector <int>, Compare> Heap;

vector <pair <int,int> > g[50001];

int main()
{
  freopen("distante.in","r",stdin);
  freopen("distante.out","w",stdout);
  int n,m,i,x,y,c,t,s,k;
  scanf("%d",&t);
  for(k=1;k<=t;k++)
  {
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=n;i++)
    {
      scanf("%d",&dist[i]);
    }
    for(i=1;i<=n;i++)
      g[i].clear();
    for(i=1;i<=m;i++)
    {
      scanf("%d%d%d",&x,&y,&c);
      g[x].push_back(make_pair(y,c));
      g[y].push_back(make_pair(x,c));
    }
    for(i=1;i<=n;i++)
      cost[i]=1<<31-1;
    Heap.push(s);
    cost[s]=0;
    while(!Heap.empty())
    {
      int nod=Heap.top();
      Heap.pop();
      for(i=0;i<g[nod].size();i++)
      {
        int vec=g[nod][i].first;
        int muc=g[nod][i].second;
        if(cost[nod]+muc<cost[vec])
        {
          cost[vec]=cost[nod]+muc;
          Heap.push(vec);
        }
      }
    }
    int pp=1;
    for(i=2;i<=n;i++)
      if(cost[i]!=dist[i])
        pp=0;
    if(pp==1)
      printf("DA\n");
    else
      printf("NU\n");
  }
  return 0;
}