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