#include <fstream>
#include <queue>
#include <vector>
#define N 50002
#define INF 2000000000
#include <deque>

using namespace std;

int dc[N],dist[N];

struct bla
{
    int ve,co;
};
vector <bla> graph[N];
bool viz[N];
deque <int> q;

void bf(int nod)
{
    q.push_back(nod);
    dist[nod]=0;
    viz[nod]=1;
    while(!q.empty())
    {
        nod=q.front();
        q.pop_front();
        viz[nod]=0;
        for(int i=0;i<graph[nod].size();++i)
            if(dist[graph[nod][i].ve]>dist[nod]+graph[nod][i].co && !viz[graph[nod][i].ve])
            {
                viz[graph[nod][i].ve]=1;
                dist[graph[nod][i].ve]=dist[nod]+graph[nod][i].co;
                q.push_back(graph[nod][i].ve);
            }
    }
}
int main()
{
    ifstream f("distante.in");
    ofstream g("distante.out");
    int t,n,m,st,x,y,c,ok;
    f>>t;
    while(t--)
    {
        f>>n>>m>>st;
        ok=1;
        for(int i=1;i<=n;++i) f>>dc[i],dist[i]=INF,viz[i]=0;
        for(int i=1;i<=m;++i)
        {
            f>>x>>y>>c;
            graph[x].push_back({y,c});
            graph[y].push_back({x,c});
        }
        bf(st);
        for(int i=1;i<=n;++i)
            if(dist[i]!=dc[i])
            {
                g<<"NU\n";
                ok=0;
                break;
            }
            if(ok)
                g<<"DA\n";
        for(int i=1;i<=n;++i) graph[i].clear();
    }
    f.close();
    g.close();
    return 0;
}