#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <limits.h>
#define MAX 50003

using namespace std;

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

vector<pair<int, int>> vec[MAX];
vector<pair<int, int>> dist;
int dis[MAX];
int dis2[MAX];

void dijkstra(int s) {

    dist.push_back(make_pair(0, s));
    int nod,cos;
    vector<pair<int, int>>::iterator it;

    while(!dist.empty()) {

        nod = (*dist.begin()).second;
        cos = -(*dist.begin()).first;
        pop_heap(dist.begin(), dist.end());
        dist.pop_back();
        dis2[nod] = cos;

        for(it = vec[nod].begin(); it != vec[nod].end(); it++) {

            if(cos+it->second < dis2[it->first]) {

                dis2[it->first] = cos+it->second;
                dist.push_back(make_pair(-dis2[it->first], it->first));
                push_heap(dist.begin(), dist.end());

            }

        }

    }

}

void sol() {

    int n,m,s,a,b,c;
    in >> n >> m >> s;
    for(int i = 1; i <= n; i++)
        in >> dis[i];

    for(int i = 1; i <= n; i++) {
        while(!vec[i].empty())
            vec[i].pop_back();
        dis2[i] = INT_MAX;
    }

    for(int i = 1; i <= m; i++) {
        in >> a >> b >> c;
        vec[a].push_back(make_pair(b, c));
        vec[b].push_back(make_pair(a, c));
    }

    dijkstra(s);

    for(int i = 1; i <= n; i++) {

        if(dis2[i] == INT_MAX)
            dis2[i] = 0;

        if(dis[i] != dis2[i]) {

            out << "NU" << '\n';
            return;

        }

    }

    out << "DA" << '\n';

}

int main() {

    int t;
    in >> t;

    for(int i = 0; i < t; i++)
        sol();

    return 0;
}