#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <set>

#define NMax 50005
#define INF 0x3f3f3f3f
using namespace std;

int dist[NMax],d[NMax];
vector<pair<int,int> > vecini[NMax];
set<pair<int,int> > H;
int n,m,x,y,c,T,s;

void dijkstra(int x0){
    memset(dist,INF,sizeof(dist));

    dist[x0] = 0;

    H.insert(make_pair(0, x0));

    while(!H.empty()){
        int nod = (*H.begin()).second;
        H.erase(*H.begin());
        for(int i = 0; i < vecini[nod].size(); ++i){
            if(dist[vecini[nod][i].first] > dist[nod] + vecini[nod][i].second){
                dist[vecini[nod][i].first] = dist[nod] + vecini[nod][i].second;
                H.insert(make_pair(dist[vecini[nod][i].first], vecini[nod][i].first));
            }
        }
    }
}
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&T);
    for(int i = 1; i <= T; i++){
        scanf("%d%d%d",&n,&m,&s);
        for(int i = 1; i <= n; i++){
            scanf("%d",&d[i]);
        }
        for(int i = 1; i <= n; i++){
            vecini[i].clear();
        }
        for(int i = 1; i <= m; i++){
            scanf("%d%d%d",&x,&y,&c);
            vecini[x].push_back(make_pair(y,c));
            vecini[y].push_back(make_pair(x,c));
        }
        if(dist[s] != 0){
            printf("NU\n");continue;}
        dijkstra(s);
        int da = 1;
        for(int i = 1; i <= n; i++){
            if(dist[i] != d[i]){
                da = 0;
                break;
            }
        }
        if(da == 1)
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}