#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,tata[100001],x,y,rx,ry,t;
int rad(int x)
{
    while(tata[x]>0)
        x=tata[x];

    return x;

}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        tata[i]=-1;

    for(int i=1;i<=m;i++){
        fin>>t>>x>>y;
        if(t==1)
        {
            rx=rad(x);
            ry=rad(y);

            if(rx!=ry)
            {
                if(tata[rx]<tata[ry])///rx devine radacina arborelui unificat
                {
                    tata[rx]+=tata[ry];
                    tata[ry]=rx;
                }
                else  ///ry devine radacina arborelui unificat
                {
                    tata[ry]+=tata[rx];
                    tata[rx]=ry;
                }
            }
        }
        else{
            rx=rad(x);
            ry=rad(y);
            if(rx==ry)
               fout<<"DA"<<endl;
            else
                fout<<"NU"<<endl;


        }


    }
}