#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int NMAX=100001;
int n,t[NMAX],m,task,x,y;
int find_(int nod)
{
    if(nod==t[nod]) return nod;
    t[nod]=find_(t[nod]);
    return t[nod];
}
void union_(int x,int y)
{
    if(x<y)
    t[x]=y;
    else
    t[y]=x;
}
int main()
{
    cin>>n;
    cin>>m;
    for(int i=1; i<=n; i++)
    {
        t[i]=i;
    }
    for(int i=1; i<=m; i++)
    {
        cin>>task>>x>>y;
        int tx=find_(x);
        int ty=find_(y);
        if(task==1)
        {

            if(tx!=ty)
                union_(tx,ty);
        }
        else

            {
                if(tx==ty)
                cout<<"DA"<<endl;
                else
                cout<<"NU"<<endl;
            }
    }
    return 0;
}