#include<fstream>
#define nod1 second.first
#define nod2 second.second
#define cost first
using namespace std;
ifstream f("apm.in");
ofstream g("apm.out");
int n, m, t[100003], rx, ry, op, x, y;
pair<int, pair<int, int> > l[400002];
int rad(int x)
{
    while(t[x]>0)
        x=t[x];
    return x;
}
int main()
{
    f>>n>>m;
    for(int i;i<=n;i++)
        t[i]=-1;
    for(i=1;i<=m;i++)
        f>>l[i].cost>>l[i].nod1>>l[i].nod2;
    sort(l,l+m+1);

        rx=rad(x);
        ry=rad(y);
        if(op==2)
            g<<(rx==ry? "DA\n":"NU\n");
        else
        {
            if(rx!=ry)
                if(t[rx]<t[ry])
                {
                    t[rx]+=t[ry];
                    t[ry]=rx;
                }
                else
                {
                    t[ry]+=t[rx];
                    t[rx]=ry;
                }
        }
    }
    return 0;
}