#include <bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int rang[100003],tata[100003];
int op,x,y;
inline void unite(int a,int b)
{
    if (rang[a]>=rang[b]) tata[b]=a,rang[a]++;
    else tata[a]=b,rang[b]++;
}
inline int findtata(int nod)
{
    while (tata[nod]!=nod) nod=tata[nod];
    return nod;
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
        tata[i]=i;
    while (m--)
    {
        fin>>op>>x>>y;
        if (op==1) unite(x,y);
        else
        {
            int tata1=findtata(x);
            int tata2=findtata(y);
            if (tata1==tata2)
                fout<<"DA";
            else
                fout<<"NU";
            fout<<'\n';
        }
    }
    return 0;
}