#include <bits/stdc++.h>
#define inf 2000000000
#define DIM 50010
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int t,n,m,i,d[DIM],D[DIM],s,nod,vecin,cost,x,y,c;
set< pair<int,int> > S;
vector< pair<int,int> > L[DIM];
void dijkstra(int s) {
    for (int i=1;i<=n;i++)
        d[i]=inf;
    d[s]=0;
    S.insert({0,s});
    while (!S.empty()) {
        nod=S.begin()->second;
        S.erase(S.begin());
        for (auto it:L[nod]) {
            vecin=it.first, cost=it.second;
            if (d[vecin]>d[nod]+cost) {
                S.erase({d[vecin],vecin});
                d[vecin]=d[nod]+cost;
                S.insert({d[vecin],vecin});
            }
        }
    }
}
int main() {
    fin>>t;
    while (t--) {
        fin>>n>>m>>s;
        for (i=1;i<=n;i++)
            fin>>D[i];
        if (D[s]!=0) {
            fout<<"NU\n";
            continue;
        }
        for (i=1;i<=n;i++)
            L[i].clear();
        for (i=1;i<=m;i++) {
            fin>>x>>y>>c;
            L[x].push_back({y,c});
            L[y].push_back({x,c});
        }
        dijkstra(s);
        int cnt=0;
        for (i=1;i<=n;i++) {
            if (d[i]==D[i])
                cnt++;
            else {
                fout<<"NU\n";
                break;
            }
        }
        if (cnt==n)
            fout<<"DA\n";
    }
    return 0;
}