#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <set>

using namespace std;

vector <pair<int,int>> g[50005];
set <pair<int,int>> q;
int d[50005],n,k,s,m,z[50005],a,b,c;

void drum(){
    memset(d,0x3f3f3f3f,sizeof d);
    d[s]=0;
    q.insert({0,s});
    while(!q.empty()){
        auto l = *q.begin();
        q.erase(q.begin());
        for(auto i : g[l.second]){
            if(d[i.first]>d[l.second]+i.second){
                if(d[i.first]!=0x3f3f3f3f)
                    q.erase(q.find({d[i.first],i.first}));
                d[i.first]=d[l.second]+i.second;
                q.insert({d[i.first],i.first});
            }
        }
    }
}

int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    cin>>k;
    for(int i=0;i<k;++i){
        cin>>n>>m>>s;
        for(int j=1;j<=n;++j)
            cin>>z[j], g[j].clear();
        for(int j=0;j<m;++j){
            cin>>a>>b>>c;
            g[a].push_back({b,c});
            g[b].push_back({a,c});
        }
        drum();
        bool ok=1;
        for(int j=1;j<=n;++j){
            if(d[j]!=z[j]){
                ok=0;
                break;
            }
        }
        if(ok)
            cout<<"DA\n";
        else
            cout<<"NU\n";
    }
    return 0;
}