#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;

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

vector<pair<int, int> > g[50010];
int n, m, s, t;
int distante[50010];

void citireGraf() {
    fin >> n >> m >> s;
    for(int i = 1; i <= n; i++)
        g[i].clear();
    for(int i = 1; i <= n; i++)
        fin >> distante[i];
    for(int i = 1; i <= m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        g[a].push_back({b, c});
        g[b].push_back({a, c});
    }
}

void solve() {
    int d[50010];
    for(int i = 1; i <= n; i++)
        d[i] = -1;
    priority_queue<pair<int, int> > q;
    q.push({0, s});
    while(!q.empty()) {
        int nod = q.top().second;
        int cost = q.top().first;
        q.pop();
        if(d[nod] != -1) continue;
        d[nod] = -cost;
        for(int i = 0; i < g[nod].size(); i++)
            q.push({cost - g[nod][i].second, g[nod][i].first});
    }

    bool ok = true;
    for(int i = 1; i <= n; i++)
        if(d[i] != distante[i]) {
            fout << "NU\n";
            ok = false;
            break;
        }
    if(ok) fout << "DA\n";
}

int main() {
    fin >> t;
    while(t--) {
        citireGraf();
        solve();
    }
}