#include <fstream>
#include <cstdio>
using namespace std;
int t[100010],ce,x,y,rang[100010],m,n,i;
/*int parfum(int x){
    if(x==t[x])return x;
    else t[x]=parfum(t[x]);}*/
    int parfum(int x){
    int r = x;
    for (; r != t[r]; r = t[r]);

    while (t[x] != x)
    {
        int cx = t[x];
        t[x] = r;
        x = cx;
    }

    return r;
}
int reunire(int x,int y){
    x=parfum(x);
    y=parfum(y);
    if(rang[x]>rang[y])t[y]=x;
    else t[x]=y;
  if(rang[x]==rang[y])rang[x]++;}
int main()
{
    freopen("disjoint.in","r",stdin);
    ofstream g ("disjoint.out");
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++){
    t[i]=i;rang[i]=i;}
    for(i=1;i<=m;i++){
    scanf("%d%d%d",&ce,&x,&y);
    if(ce==1)reunire(parfum(x),parfum(y));
    else if(parfum(x)==parfum(y))g<<"DA"<<'\n';
    else g<<"NU"<<'\n';}
    return 0;}