#include <iostream>
#include <queue>
#include <vector>
#include <stdio.h>

#define NMAX 50000
#define INFINIT 1000000000

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

struct muchie {
  int to ;
  int cost ;
  bool operator < (const muchie& a) const {
    return this->cost > a.cost ;
  }
};

int distgigel [ NMAX + 1 ] ;
vector<muchie> g [ NMAX + 1 ] ;
int mydist [ NMAX + 1 ] ;

bool dijkstra (int n, int sursa ) {
  int i ;
  for (i = 1 ; i <= n ; i++ )
    mydist[i] = INFINIT ;
  priority_queue<muchie> q ;
  mydist[sursa] = 0 ;
  for (auto elem : g[sursa] )
    q.push({elem.to, elem.cost+mydist[sursa]}) ;
  while (!q.empty()) {
    if (mydist[q.top().to] == INFINIT ) {
      int next = q.top().to ;
      int val = q.top().cost ;
      mydist[next] = val ;
      q.pop() ;
      for (auto elem : g[next])
        if (mydist[elem.to] == INFINIT )
          q.push({elem.to, val+elem.cost}) ;
    }
    else
      q.pop() ;
  }
  i = 1 ;
  while ( i <= n && mydist[i] == distgigel[i] )
    i++;
  return (i > n ) ;
}

int main() {
  InParser fin ("distante.in") ;
  OutParser fout ("distante.out" ) ;
  int n, t, s, m, i, c, a, b ;
  fin >> t ;
  while (t > 0 ) {
    fin >> n >> m >> s ;
    for (i = 1 ; i <= n ; i++ )
      fin >> distgigel[i] ;
    for (i = 1 ; i <= m ; i++ ) {
      fin >> a >> b >> c ;
      g[a].push_back({b, c}) ;
      g[b].push_back({a, c}) ;
    }
    if (dijkstra(n, s))
      fout << "DA\n" ;
    else
      fout << "NU\n" ;
    for (i = 1 ; i <= n ; i++ )
      g[i].clear() ;
    t--;
  }
  return 0;
}