#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int Nmax=100005;
int t[Nmax],v[Nmax],n,m,op;
void init()
{
    for(int i=1; i<=n; i++)
        t[i]=i;
}
int Find(int x)
{
    int r=x;
    while(t[r]!=r)
        r=t[r];
        ///+path compression
    while(t[x]!=r)
    {
        int w=t[x];
        t[x]=r;
        x=w;
    }
    return r;
}
void Union(int x,int y)
{
    int p=Find(x);
    int q=Find(y);
    if(p!=q)
        t[p]=q;
}
int main()
{

    fin>>n>>m;
    init();
    while(m--)
    {
        int x1,x2;
        fin>>op>>x1>>x2;
        if(op==1)
            Union(x1,x2);
        if(op==2)
            if(Find(x1)==Find(x2))
            {
                // cout<<x1<<" "<<x2<<" Fac parte din acelasi set!\n";
                fout<<"DA\n";
            }
            else
            {
                // cout<<"Nu fac parte inca din aceeasi multime!\n";
                fout<<"NU\n";
            }
    }
}