/*
#include <iostream>
#include  <vector>
#include <queue>
using namespace std;
vector<vector<pair<int,int>>>gr;
vector<int>distMin;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>q;
const int inf=1e9;
int main(){
int n,m;
cin>>n>>m;
gr.resize(n+1);
distMin.resize(n+1);
for(int i=2;i<=n;i++){
    distMin[i]=inf;
}
int a,b,c;
for(int i=1;i<=m;i++){
    cin>>a>>b>>c;
    gr[a].push_back({b,c});
}
q.push({0,1});
while(!q.empty()){
    pair<int,int>now=q.top();
    q.pop();
    int nodCurent=now.second;
    int valCurent=now.first;
    if(distMin[nodCurent]!=valCurent){
        continue;
    }
    for(auto&x:gr[nodCurent]){
        if(distMin[x.first]>x.second+valCurent){
            distMin[x.first]=x.second+valCurent;
            q.push({distMin[x.first],x.first});
        }
    }
}
for(int i=2;i<=n;i++){
    if(distMin[i]==inf){
        cout<<0;
    }else{
        cout<<distMin[i]<<" ";
    }
}
}
*/
/*

#include <fstream>
#include  <vector>
#include <queue>
using namespace std;
ifstream cin("catun.in");
ofstream cout("catun.out");
vector<vector<pair<int,int>>>gr;
vector<int>distMin;
vector<int>fortareataMinima;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>q;
const int inf=1e9;
int main(){
int n,m,k;
cin>>n>>m>>k;
gr.resize(n+1);
fortareataMinima.resize(n+1,0);
distMin.resize(n+1,inf);
int nr;
for(int i=1;i<=k;i++){
    cin>>nr;
    fortareataMinima[nr]=nr;
    distMin[nr]=0;
    q.push({0,nr});
}

int a,b,c;
for(int i=1;i<=m;i++){
    cin>>a>>b>>c;
    gr[a].push_back({b,c});
    gr[b].push_back({a,c});
}
while(!q.empty()){
    pair<int,int>now=q.top();
    q.pop();
    int nodCurent=now.second;
    int valCurent=now.first;
    if(distMin[nodCurent]!=valCurent){
        continue;
    }
    for(auto&x:gr[nodCurent]){
        if(distMin[x.first]>x.second+valCurent || distMin[x.first]==x.second+valCurent && fortareataMinima[nodCurent]<fortareataMinima[x.first]){
            distMin[x.first]=x.second+valCurent;
            fortareataMinima[x.first]=fortareataMinima[nodCurent];
            q.push({distMin[x.first],x.first});
        }
    }
}
for(int i=1;i<=n;i++){
    if(fortareataMinima[i]==i){
        cout<<0<<" ";
    }else{
        cout<<fortareataMinima[i]<<" ";
    }
}
}
*/
/*
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int>distMin;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>q;
vector<int>fortareataMin;
vector<vector<pair<int,int>>>gr;
const int inf=1e9;
int main(){
int n,m,k;
cin>>n>>m>>k;
distMin.resize(n+1,inf);
fortareataMin.resize(n+1);
gr.resize(n+1);
int nr;
for(int i=1;i<=k;i++){
    cin>>nr;
    fortareataMin[nr]=nr;
    distMin[nr]=0;
    q.push({0,nr});
}
int a,b,c;
for(int i=1;i<=m;i++){
   cin>>a>>b>>c;
   gr[a].push_back({b,c});
   gr[b].push_back({a,c});
}
while(!q.empty()){
pair<int,int>acum=q.top();
q.pop();
int nodCurent=acum.second;
int valCurent=acum.first;
if(valCurent!=distMin[nodCurent]){
    continue;
}
for(auto&x:gr[nodCurent]){
    if(distMin[x.first]>x.second+valCurent || distMin[x.first]==x.second+valCurent&& fortareataMin[x.first]>fortareataMin[nodCurent]){
        distMin[x.first]=x.second+valCurent;
        fortareataMin[x.first]=fortareataMin[nodCurent];
        q.push({distMin[x.first],x.first});
    }
}
}
for(int i=1;i<=n;i++){
    if(fortareataMin[i]==i){
        cout<<0<<" ";
    }else{
        cout<<fortareataMin[i]<<" ";
    }
}
}
*/
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>q;
vector<vector<pair<int,int>>>gr;
vector<int>distMin,distMin1;
const int inf=1e9;
void golire(int n)
{
    gr.clear();
    distMin.clear();
    distMin1.clear();
    distMin.resize(n+1,inf);
    distMin1.resize(n+1);
    gr.resize(n+1);

}
void dijkstra()
{
    while(!q.empty())
    {
        pair<int,int>acum=q.top();
        q.pop();
        int nodCurent=acum.second;
        int valCurent=acum.first;
        if(distMin[nodCurent]!=valCurent)
        {
            continue;
        }
        for(auto&x:gr[nodCurent])
        {
            if(distMin[x.first]>valCurent+x.second)
            {
                distMin[x.first]=valCurent+x.second;
                q.push({distMin[x.first],x.first});
            }
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    int n,m,s;
    while(t--)
    {
        cin>>n>>m>>s;
        golire(n);
        int nr;
        for(int i=1; i<=n; i++)
        {
            cin>>nr;
            distMin1[i]=nr;
        }
        int a,b,c;
        for(int i=1; i<=m; i++)
        {
            cin>>a>>b>>c;
            gr[a].push_back({b,c});
            gr[b].push_back({a,c});
        }
        distMin1[s]=0;
        distMin[s]=0;
        q.push({0,s});
        dijkstra();
        bool ok=true;
        for(int i=1; i<=n; i++){
        if(distMin[i]!=distMin1[i]){
            ok=false;
        }
        }
        if(ok){
            cout<<"DA"<<'\n';
        }else{
            cout<<"NU"<<'\n';
        }

    }

}