#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");

int teste, n, m, start, i, j, verifica[50010], v[50010], d[50010], x, y, c, ok;
vector < pair<int, int> > a[50010];
queue <int> q;

void bellman(int start){
    for(int i=1; i<=n; i++){
        d[i]=1000000000;
        v[i]=0;
    }
    q.push(start);
    d[start]=0;
    while(!q.empty()){
        int nod=q.front();
        q.pop();
        /// nu avem costuri negative deci nu verificam pentru ciclu negativ
        v[nod]=0;
        for(int i=0; i<a[nod].size(); i++){
            int vecin=a[nod][i].first;
            int cost=a[nod][i].second;
            if(d[nod]+cost<d[vecin]){
                d[vecin]=d[nod]+cost;
                if(v[vecin]==0){
                    v[vecin]=1;
                    q.push(vecin);
                }
            }
        }
    }
}


int main(){
    fin>>teste;
    while(teste){
        fin>>n>>m>>start;
        for(i=1; i<=n; i++){
            fin>>verifica[i];
        }
        for(i=1; i<=m; i++){
            fin>>x>>y>>c;
            a[x].push_back(make_pair(y, c));
            a[y].push_back(make_pair(x, c));
        }
        bellman(start);
        ok=1;
        for(i=1; i<=n; i++){
            // fout<<d[i]<<" ";
            if(d[i]!=verifica[i]){
                ok=0;
                break;
            }
        }
        if(ok){
            fout<<"DA"<<"\n";
        }else{
            fout<<"NU"<<"\n";
        }
        teste--;
    }
}