#include <fstream>
#include <vector>
#include <climits>
#include <queue>
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
int n,m,s;
vector<pair<int,int>>adj[50005];
int dist[50005];
int V[50005];
void dijkstra(){
    for(int i=1;i<=n;i++) dist[i]=INT_MAX;
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
    pq.push({0,s});
    dist[s]=0;
    while(!pq.empty()){
        int nod=pq.top().second,d=pq.top().first;
        pq.pop();
        if(dist[nod]!=d) continue;
        for(auto e:adj[nod]){
            int next=e.first,cost=e.second;
            if(dist[next]>dist[nod]+cost){
                dist[next]=dist[nod]+cost;
                pq.push({dist[next],next});
            }
        }
    }
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        for(int i=1;i<=n;i++){
            adj[i].clear();
        }
        cin>>n>>m>>s;
        for(int i=1;i<=n;i++) cin>>V[i];
        for(int i=1;i<=m;i++){
            int a,b,c;
            cin>>a>>b>>c;
            adj[a].push_back({b,c});
            adj[b].push_back({a,c});
        }
        dijkstra();
        bool ok=1;
        for(int i=1;i<=n;i++){
            if(V[i]!=dist[i]) ok=0;
        }
        if(ok==1) cout<<"DA\n";
        else cout<<"NU\n";
    }
    return 0;
}