#include <bits/stdc++.h>
using namespace std;
#define MAXN 100000

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int nxt[MAXN + 1];

inline void Union(int x,int y){
    nxt[y] = x;
}

int Find(int x){
    int sef,aux;

    sef = x;
    while (nxt[sef])
        sef = nxt[sef];

    while (nxt[x]){
        aux = nxt[x];
        nxt[x] = sef;
        x = aux;
    }

    return sef;
}

int main(){
    int n,m,cer,x,y,i;

    fin >> n >> m;

    for (i = 1; i <= m; i ++){
        fin >> cer >> x >> y;
        if (cer == 1)
            Union(x,y);
        else{
            if (Find(x) == Find(y))
                fout << "DA";
            else
                fout << "NU";

            fout << '\n';
        }
    }

    return 0;
}