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

ifstream t("disjoint.in");
ofstream o("disjoint.out");

int n,m,p[100000],c,g,f;

int parinte(int nod)
{
    if(p[nod]==nod){
        return nod;
    }
    return parinte(p[nod]);
}

int unite(int x,int y)
{
    p[parinte(x)]=parinte(y);
}

int main()
{
    t>>n>>m;
    for(int i=1;i<=n;i=i+1){
        p[i]=i;
    }
    for(int i=1;i<=m;i=i+1){
        t>>c>>f>>g;
        if(c==1){
            unite(f,g);
        }
        else{
            if(parinte(f)==parinte(g)){
                o<<"DA"<<"\n";
            }
            else{
                o<<"NU"<<"\n";
            }
        }
    }
    return 0;
}