#include <iostream>
#include <fstream>
#define NMAX 100001

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n, m, t[NMAX], h[NMAX];

int _find(int x)
{
    int r=x, y=x, taux;
    while(t[r]!=0)r=t[r];
    while(y!=r){
        taux=t[y];
        t[y]=r;
        y=taux;
    }
    return r;
}

void _union(int x,int y)
{
    int c;
    if(h[x]<h[y]){
        t[x]=y;
        c=y;
    }
    else{
        t[y]=x;
        c=x;
    }
    if(h[x]==h[y])h[c]++;
}

int main()
{
    int i,cod,x,y;

    for(i=1;i<=n;i++){
        t[i]=0;
        h[i]=i;
    }

    f>>n>>m;
    for (i=1;i<=m;i++){
        f>>cod>>x>>y;
        switch(cod){
            case 2:{
                if(_find(x)==_find(y))g<<"DA";
                else g<<"NU";
                g<<'\n';
                break;
            }
            case 1:{
                _union(x, y);
                break;
            }
        }
    }

    return 0;
}