#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

vector<int> T,Rang;
int n,m;

int cauta(int x)
{
    int R=x,aux;
    while(R!=T[R])
        R=T[R];

    while(T[x]!=x)
    {
        aux=T[x];
        T[x]=R;
        x=aux;
    }
    return R;
}

void join(int x, int y)
{
    if(Rang[x]>Rang[y])
        T[y]=x;
    else T[x]=y;
    if(Rang[x]==Rang[y])
        Rang[y]++;
}

int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f>>n>>m;
    T.resize(n+1);
    Rang.resize(n+1);
    for(int i=1;i<=n;i++)
    {
        T[i]=i;
        Rang[i]=0;
    }
    int cod,x,y;
    for(int i=1;i<=m;i++)
    {
        f>>cod>>x>>y;
        if(cod==2)
        {
            if(cauta(x)==cauta(y))
                g<<"DA"<<'\n';
            else g<<"NU"<<'\n';
        }
        else join(cauta(x),cauta(y));
    }
    return 0;
}