#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <queue>
#include <list>
//#include <windows.h>
//#include <conio.h>
#include <cstdlib>
#include <time.h>
#include <limits.h>
#include <string>
#include <math.h>
using namespace std;
#define forA(V,it) for (typeof(V.begin()) it=V.begin();it!=V.end();it++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define ull unsigned ll
#define MOD 1000000007
#define INF (1<<31)-1
#define MINF -(1<<31)
#define vi vector <int>
#define vll vector <ll>
#define pii pair <int,int>
#define pll pair <ll,ll>
#define newl printf("\n")
#define DIM 1000000
int D[50005],N,M,S,i,T;
bool viz[50005];
int main()
{
    freopen("distante.in","r",stdin);
    freopen("distante.out","w",stdout);
    scanf("%d",&T);
    while (T--)
    {
        bool ok=true;
        scanf("%d %d %d",&N,&M,&S);
        for (i=1;i<=N;i++) scanf("%d",&D[i]),viz[i]=false;
        if (D[S]!=0) ok=false;
        viz[S]=true;
        for (i=1;i<=M;i++)
        {
            int x,y,z;
            scanf("%d %d %d",&x,&y,&z);
            if (D[x]+z<D[y]) ok=false;
            if (D[x]+z==D[y]) viz[y]=true;
            if (D[y]+z<D[x]) ok=false;
            if (D[y]+z==D[x]) viz[x]=true;
        }
        for (i=1;i<=N && ok;i++) if (!viz[i]) ok=false;
        if (ok) printf("DA\n");
        else printf("NU\n");
    }
    return 0;
}