#include <iostream>
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,i,op,x,y;
struct nod
{
    int info;
    nod *leg;
};
nod *lprim[100000],*lultim[100000];
void adauga(int info1)
{
    nod *p;p=new nod;
    p->leg=NULL;
    p->info=info1;
    if(lprim[info1]==NULL)
    {
        lprim[info1]=lultim[info1]=p;
    }
    else
    {
        lultim[info1]->leg=p;
        lultim[info1]=p;
    }
}
void reuneste(int x,int y)
{
    lultim[x]->leg=lprim[y];
    lultim[x]=lultim[y];
    lprim[y]=lprim[x];
}
bool gasit(int x,int y)
{
    if(lprim[x]==lprim[y] && lultim[x]==lultim[y]) return 1;
    return 0;
}
int main()
{
    f>>n>>m;
    for(i=0;i<=100000;i++) lprim[i]=lultim[i]=NULL;
    for(i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        if(op==1)
        {
            adauga(x);
            adauga(y);
            reuneste(x,y);
        }
        else
        {
            if(gasit(x,y)) g<<"DA"<<endl;
            else g<<"NU"<<endl;
        }
    }
}