#include <fstream>

using namespace std;

ifstream fin("distante.in");
ofstream fout("distante.out");

int T, N, M, S;
int D[50005];

int main()
{
    fin >> T;
    while (T--)
    {
        fin >> N >> M >> S;
        for (int i = 1; i <= N; ++i)
            fin >> D[i];

        bool ok = true;
        for (int i = 1, nod1, nod2, cost; i <= M; ++i)
        {
            fin >> nod1 >> nod2 >> cost;

            if (D[nod1] + cost < D[nod2] || D[nod2] + cost < D[nod1])
                ok = false;
        }

        if (D[S] != 0)
            ok = false;

        if (ok)
            fout << "DA\n";
        else
            fout << "NU\n";
    }

    fin.close();
    fout.close();
    return 0;
}