#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int n,m,start,T;
vector <vector <pair <int, int> > > vecini;
void dijkstra(int start, vector<bool> &vizitat, vector<int> &distanta){
    priority_queue <pair<int, int>, vector <pair<int,int> >, greater <pair<int,int> > > Q;
    Q.push(make_pair(0,start));
    while(Q.empty()==0){
        int nod_curent=Q.top().second;
        Q.pop();
        if(vizitat[nod_curent]==0){
            for(int i=0;i<int(vecini[nod_curent].size());i++){
                int vecin=vecini[nod_curent][i].first;
                if(distanta[vecin]>distanta[nod_curent]+vecini[nod_curent][i].second){
                    distanta[vecin]=distanta[nod_curent]+vecini[nod_curent][i].second;
                    Q.push(make_pair(distanta[vecin], vecin));
                }
            }
        }
    }
}
int main()
{
    f>>T;
    for(int i=1;i<=T;i++){
        f>>n>>m>>start;
        int distante_bronzanel[n+1];
        for(int j=1;j<=n;j++){
            f>>distante_bronzanel[j];
        }
        vector<bool> vizitat;
        vizitat.resize(n+1,0);
        vector<int> distanta;
        distanta.resize(n+1,INT_MAX);
        distanta[start]=0;
        vecini.resize(n+1);
        for(int j=1;j<=m;j++){
            int a,b,c;
            f>>a>>b>>c;
            vecini[a].push_back(make_pair(b,c));
            vecini[b].push_back(make_pair(a,c));
        }
        dijkstra(start, vizitat, distanta);
        bool OK=1;
        for(int j=1;j<=n;j++){
            if(distanta[j]!=distante_bronzanel[j]){
                OK=0;
                break;
            }
        }
        if(OK==1){
            g<<"DA\n";
        }
        else
        g<<"NU\n";
    }
    return 0;
}