#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#define INF 1000000001
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
const int N=5e4+1;
int t,n,m,nod;
int br[N],d[N];
vector <pair<int,int>> a[N];
priority_queue <pair<int,int>> q;
bitset <N> selectat;

void dijkstra(int nod){
    for(int i=1; i<=n; i++)
        d[i]=INF;
    d[nod]=0;
    q.push({0,nod});
    while(!q.empty()){
        int x=q.top().second;
        q.pop();
        if(selectat[x])
            continue;
        selectat[x]=1;
        for(auto j:a[x]){
            int y=j.first;
            int c=j.second;
            if(d[x]+c<d[y]){
                d[y]=d[x]+c;
                q.push({-d[y],y});
            }
        }
    }
}

int main()
{
    f>>t;
    while(t){
        f>>n>>m>>nod;
        for(int i=1; i<=n; i++)
            f>>br[i];
        for(int i=1; i<=m; i++){
            int x,y,c;
            f>>x>>y>>c;
            a[x].push_back({y,c});
            a[y].push_back({x,c});
        }
        dijkstra(nod);
        bool ok=0;
        for(int i=1; i<=n && !ok; i++){
            if(br[i]!=d[i]){
                g<<"NU\n";
                ok=1;
            }
        }
        if(!ok)
            g<<"DA\n";
        t--;
    }
    return 0;
}