#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int nmax=100000;
int n,q;
int t[nmax+5],h[nmax+5];
int FindSet(int nod)
{
    while(nod!=t[nod])
        nod=t[nod];
    return nod;
}
void UnionSet(int x,int y)
{
    if(h[x]==h[y])
    {
        h[x]++;
        t[y]=x;
    }
    if(h[x]>h[y])
        t[y]=x;
    if(h[x]<h[y])
        t[x]=y;
}
int main()
{
    fin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    while(q--)
    {
        int tip,x,y;
        fin>>tip>>x>>y;
        if(tip==1)
            UnionSet(FindSet(x),FindSet(y));
        if(tip==2)
        {
            if(FindSet(x)==FindSet(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}
/**


**/