#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,t[100005],r[100005],cod,x,y,ta,tb;
int tata(int nod)
{
    if(t[nod]==nod)return nod;
    return (t[nod]=tata(t[nod]));
}
void unire(int a,int b)
{
    ta=tata(a),tb=tata(b);
    if(r[ta]>=r[tb])
    {
        t[tb]=ta;
    }
    if(r[ta]<r[tb])
    {
        t[ta]=tb;
    }
    if(r[ta]==r[tb])
    {
        r[ta]++;
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        r[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        in>>cod>>x>>y;
        if(cod==1)
        {
            unire(x,y);
        }
        else
        {
            if(tata(x)==tata(y))
            {
                out<<"DA";
            }
            else out<<"NU";
            out<<'\n';
        }
    }
    return 0;
}