#include <fstream>
using namespace std;

int t, n, m, s, cost[60100], X, Y;
int main()
{
    ifstream f("distante.in");
    ofstream g("distante.out");

    for (f >> t; t > 0; --t)
    {
        f >> n >> m >> s;
        for (int i = 1; i <= n; ++i)
            f >> cost[i];

        int ok = 1;
        if (cost[s]) ok = 0;
        for (int i = 1; i <= m; ++i)
        {
            int c;
            f >> X >> Y >> c;
            if (cost[X] + c < cost[Y] || cost[Y] + c < cost[X])
                ok = 0;
        }
        if (ok) g << "DA\n";
        else g << "NU\n";
    }

    g.close();
    return 0;
}