#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <iterator>
#define inf 100001

using namespace std;

ifstream in("distante.in");
ofstream out("distante.out");

vector <pair <int, int > > vecini[50001];
vector <pair <int, int > > :: iterator it;
priority_queue < pair <int, int>, vector < pair <int, int> >, greater <pair <int, int> > > pq;
int dist [50001];
bool viz[50001];
int n, m, s;

void citireGraf(){
    for(int i = 1; i <= m; i++)
    {
        int  x, y, c;
        in >> x >> y >> c;
        vecini[x].push_back({y, c});
        vecini[y].push_back({x,c});
    }
}

void dijkstra(int plec){
    for(int i=1; i<=n; i++){
        dist[i]=inf;
        viz[i] = false;
      }
    dist[plec]=0;
    pq.push({dist[plec], plec});
    while(!pq.empty())
    {
        int minim = pq.top().second;
        pq.pop();
        if(!viz[minim])
        {
            viz[minim] = true;
            for(it = vecini[minim].begin(); it!=vecini[minim].end(); it++)
                if(dist[it->first] > dist[minim] + it->second)
                {
                    dist[it->first] = dist[minim] + it->second;
                    if(!viz[it->first])
                        pq.push({dist[it->first], it->first});
                }
        }
    }
}

void citire(){
  int t;//nr de matrice ce trebuie verificate
  int distanteDate[50001];
  in >> t;
  for(int nr = 1; nr <= t; nr++){
    in >> n >> m >> s;
    for(int i = 1; i <= n; i++)
      in >> distanteDate[i];
    citireGraf();
    dijkstra(s);
    bool ok = true;
    for(int j = 1; j <= n; j++){
      if(dist[j] == inf)
        dist[j] = 0;
      if(dist[j] != distanteDate[j]){
        ok = false;
        out <<"NU\n";
        break;
      }
    }
    if(ok == true)
      out << "DA\n";
    for(int i = 1; i <= n; i++){
      while(!vecini[i].empty())
        vecini[i].pop_back();
    }
  }
}

int main(){
  citire();
  return 0;
}