//#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
#define mx 100005
//#define co 1001
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int n,m,s,dist[mx],a[mx];
vector<int> t[mx], v[mx];
struct cmp{
    bool operator() (pair<int,int> a,pair<int, int> b){
    return (a.first>b.first);
    }

};
priority_queue <pair<int, int>, vector<pair<int, int> >,cmp> q;

void citire()
{
    int i,x,y,c;
    fin>>n>>m>>s;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        t[x].push_back(y);
        t[y].push_back(x);
        v[x].push_back(c);
        v[y].push_back(c);
    }
    for(i=1;i<=n;i++)
        dist[i]=inf;
    dist[s]=0;
}
void dj(int s)
{
    q.push(make_pair(0,s));
    while(!q.empty())
    {
        int nod=q.top().second;
        int cost=q.top().first;
        q.pop();
        for(unsigned int i=0;i<t[nod].size();++i)
            if(cost+v[nod][i]<dist[t[nod][i]])
        {
            dist[t[nod][i]]=cost+v[nod][i];
            q.push(make_pair(dist[t[nod][i]],t[nod][i]));
        }
    }
}
void afis()
{
    int i,ok=1;
    for(i=1;i<=n;i++)
        if(dist[i]==inf)
        dist[i]=0;
    for(i=1;i<=n;i++)
        if(dist[i]!=a[i])
        ok=0;
        if(ok) fout<<"da";
        else fout<<"nu";
    fout<<endl;
}
int main()
{
    int nrc,k;
    fin>>nrc;
    for(k=1;k<=nrc;k++)
    {
        citire();
    dj(s);
    afis();}
    return 0;
}