#include <bits/stdc++.h>
#define DM 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
string rez[]={"NU\n","DA\n"};
int p[DM],n,m,V,x,y;

void init(){
    for(int i=1;i<=n;++i) p[i]=i;
}
int root(int x){
    if(p[x]==x) return x;
    return (p[x]=root(p[x]));
}
void _merge(int x,int y){
    p[root(x)]=root(y);
}
void afis(){
    for(int i=1;i<=n;++i) fout<<p[i]<<" ";
    fout<<'\n';
}
int main()
{
    fin>>n>>m;
    init();
    for(int i=1;i<=m;++i){
        fin>>V>>x>>y;
        if(V==1) _merge(x,y);
        else fout<<rez[(root(x)==root(y))];
    }
    return 0;
}