#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define pb push_back
#define INF 1 << 30
#define Nmax 50005

using namespace std;

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

struct str
{
    int nod, cost;
    bool operator < (const str &other) const{
        return cost > other.cost;
    }
};
int N, M, S, T, D[Nmax], dp[Nmax], x, y, c;
vector<pair<int,int> >g[Nmax];
priority_queue<str>pq;

void dijkstra(int sursa)
{
    dp[sursa] = 0;
    pq.push({sursa, 0});
    while(!pq.empty())
    {
        int nod = pq.top().nod;
        int cost = pq.top().cost;
        pq.pop();
        if(dp[nod] != cost)continue;
        for(int i = 0 ; i < g[nod].size(); i++)
        {
            int next = g[nod][i].first;
            if(dp[nod] + g[nod][i].second < dp[next])
            {
                dp[next] = dp[nod] + g[nod][i].second;
                pq.push({next, dp[next]});
            }
        }
    }
}
int main()
{
    fin >> T;
    for(int t = 1; t <= T; t++)
    {
        fin >> N >> M >> S;
        for(int i = 1; i <= N; i++)
            fin >> D[i];
        for(int i = 1; i <= M; i++)
        {
            fin >> x >> y >> c;
            g[x].pb({y, c});
            g[y].pb({x, c});
        }
        for(int i = 1; i <= N; i++)
            dp[i] = INF;
        dijkstra(S);
        int ok = 1;
        //for(int i = 1; i <= N; i++)cout << dp[i] << " " ;
        //cout << '\n';
        for(int i = 1; i <= N; i++)
            if(dp[i] != D[i])
            {
                fout << "NU\n";
                ok = 0;
                break;
            }
        for(int j = 1; j <= N; j++)
            g[j].clear();
        if(ok == 1)
        fout << "DA\n";
    }
    return 0;
}