#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int const INF=1e9;
int n, m, i, t, a, b;
int dsu[100005], rang[100005];

int radacina(int nod){
    if(dsu[nod]==0){
        return nod;
    }else{
        int rad=radacina(dsu[nod]);
        dsu[nod]=rad;
        return rad;
    }
}

void join(int x, int y){
    int rx=radacina(x);
    int ry=radacina(y);

    if(rang[rx]<=rang[ry]){
        dsu[rx]=ry;
        rang[ry]+=rang[rx];
    }else{
        dsu[ry]=rx;
        rang[rx]+=rang[ry];
    }
}

int main()
{
    fin>>n>>m;

    for(i=1;i<=n;i++){
        rang[i]=1;
    }

    for(i=1;i<=m;i++){
        fin>>t>>a>>b;

        if(t==1){
            join(a, b);
        }
        if(t==2){
            if(radacina(a)==radacina(b))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }



    return 0;
}