#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#define inf 0x3f3f3f3f

using namespace std;

int n,m,d[50001],viz[50001],a[50001],t,s,x,y,cost;
vector<int>g[50001],c[50001];
queue <int>q;
void bellmanford(int x0){
    for(int i=1;i<=n;++i)
        d[i]=inf;
    d[x0]=0;
    q.push(x0);
    viz[x0]=1;
    while(!q.empty()){
        int x=q.front();
        for(int i=0;i<g[x].size(); ++i){
            if(d[g[x][i]]>d[x]+c[x][i]) {
                d[g[x][i]]=d[x]+c[x][i];
                if(viz[g[x][i]]==0)q.push(g[x][i]);
                viz[g[x][i]]=1;

            }
        }
        viz[x]=0;
        q.pop();
    }
}
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&t);
    for(int k=1;k<=t;k++){
        scanf("%d%d%d",&n,&m,&s);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        for(int i=1;i<=m;i++){
                scanf("%d%d%d",&x,&y,&cost);
                g[x].push_back(y);
                c[x].push_back(cost);
                g[y].push_back(x);
                c[y].push_back(cost);
        }
        bellmanford(s);
        int i;
        for(i=1;i<=n;i++){
            if(a[i]!=d[i]){printf("NU\n");break;}
            g[i].clear();
        }
        if(i==n+1) printf("DA\n");
        memset(viz,0,sizeof(viz));
    }

}