#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int NMAX = 50000;
const int INF = 2.e9;
struct muchii
{
    int nod , cost;
};
muchii temp;
vector <muchii> G[NMAX + 5];
int d[NMAX + 5] , v[NMAX + 5];
void dijkstra(int n , int start)
{
    int i , x , y;
    for(i = 1 ; i <= n ; i ++)
        d[i] = INF;
    queue <int> q;
    d[start] = 0;
    q.push(start);
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(i = 0 ; i < G[x].size() ; i ++)
        {
            y = G[x][i].nod;
            if(d[y] > d[x] + G[x][i].cost)
            {
                d[y] = d[x] + G[x][i].cost;
                q.push(y);
            }
        }
    }
}
void verif(int n)
{
    int i , ok;
    ok = 1;
    for(i = 1 ; i <= n && ok == 1 ; i ++)
        if(d[i] != v[i])
            ok = 0;
    if(ok == 1)
        printf("DA\n");
    else
        printf("NU\n");
}
int main()
{
    freopen("distante.in" , "r" , stdin);
    freopen("distante.out" , "w" , stdout);
    int t , n , m , x , y , z , i , k , start;
    scanf("%d" , &t);
    for(k = 1 ; k <= t ; k ++)
    {
        scanf("%d%d%d" , &n , &m , &start);
        for(i = 1 ; i <= n ; i ++)
            scanf("%d" , &v[i]);
        for(i = 1 ; i <= m ; i ++)
        {
            scanf("%d%d%d" , &x,  &y , &z);
            temp.nod = y;
            temp.cost = z;
            G[x].push_back(temp);
            temp.nod = x;
            G[y].push_back(temp);
        }
        dijkstra(n , start);
        verif(n);
        for(i = 1 ; i <= n ; i ++)
            G[i].clear();
    }
    return 0;
}