#include<fstream>
#include<vector>
#include<queue>
#define NMAX 50010
#define INF 100000010

using namespace std;

ifstream f("distante.in");
ofstream g("distante.out");

struct muchie
{
    int nod, cost;
};

int T, n, m, S, d[NMAX], sol[NMAX], vz[NMAX];
vector<muchie> a[NMAX];
queue<int> q;

void Initializeaza()
{
    int i;

    for (i=1; i<=n; ++i)
    {
        a[i].clear();
        d[i]=INF;
        vz[i]=0;
    }

//    q.clear();
}

void Citeste()
{
    int i, x, y;
    muchie z;

    f>>m>>S;

    for (i=1; i<=n; ++i) f>>sol[i];

    for (i=1; i<=m; ++i)
    {
        f>>x>>y>>z.cost;
        z.nod=y; a[x].push_back(z);
        z.nod=x; a[y].push_back(z);
    }
}

void Solve()
{
    int i, x, lg;
    muchie z;

    d[S]=0; q.push(S); ++vz[S];

    while (!q.empty())
    {
        x=q.front(); q.pop(); --vz[x];

        for (i=0; i<a[x].size(); ++i)
        {
            z=a[x][i];
            lg=z.cost+d[x];
            if (lg<d[z.nod])
            {
                d[z.nod]=lg;
                if (!vz[z.nod])
                {
                    q.push(z.nod);
                    ++vz[z.nod];
                }
            }
        }
    }
}

void Scrie()
{
    int i, ok=1;

    for (i=1; i<=n; ++i)
        if (sol[i]!=d[i])
        {
            ok=0;
            break;
        }

    if (ok) g<<"DA\n"; else g<<"NU\n";
}
int main()
{
    f>>T;

    while (T--)
    {
        f>>n;
        Initializeaza();
        Citeste();
        Solve();
        Scrie();
    }

    f.close();
    g.close();
    return 0;
}