#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n, m, s;
    cin >> n >> m >> s;

    vector<long long> given_d(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> given_d[i];
    }

    vector<vector<pair<int, long long>>> adj(n + 1);
    for (int i = 0; i < m; ++i) {
        int u, v;
        long long c;
        cin >> u >> v >> c;
        adj[u].push_back({v, c});
        adj[v].push_back({u, c});
    }

    if (given_d[s] != 0) {
        cout << "NU\n";
        return;
    }

    for (int u = 1; u <= n; ++u) {
        for (auto& edge : adj[u]) {
            int v = edge.first;
            long long w = edge.second;
            if (given_d[u] + w < given_d[v]) {
                cout << "NU\n";
                return;
            }
        }
    }

    vector<long long> dist(n + 1, 1e18);
    dist[s] = 0;
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    pq.push({0, s});

    while (!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();

        if (d > dist[u]) continue;
        
        if (d < given_d[u]) { 
             cout << "NU\n";
             return;
        }

        for (auto& edge : adj[u]) {
            int v = edge.first;
            long long w = edge.second;
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({dist[v], v});
            }
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (dist[i] != given_d[i]) {
            cout << "NU\n";
            return;
        }
    }

    cout << "DA\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    freopen("distante.in", "r", stdin);
    freopen("distante.out", "w", stdout);

    int t;
    if (cin >> t) {
        while (t--) {
            solve();
        }
    }

    return 0;
}