#include <bits/stdc++.h>
#define nmax  100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[nmax],n,m;
inline void Union(int x,int y)
{
    t[y]=x;
}
inline int  Find(int x)
{
    int rad=x,y;
    while(t[rad])
        rad=t[rad]; ///gasesc pentru fiecare "stramosul" cel mai mare
    while(x!=rad)
    {
        y=t[x];
        t[x]=rad;          ///actualizez
        x=y;
    }
    return rad;
}
int main()
{
    int op,x,y,i;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        x=Find(x);
        y=Find(y);
        if(op==1 && x!=y)
            Union(x,y);
        else if(x==y)fout<<"DA\n";
        else fout<<"NU\n";
    }
    fin.close();
    fout.close();
    return 0;
}