#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10 * 1e4 + 15;
const int INF = 1e8;
vector <int> g[MAXN];
int sizee[MAXN], father[MAXN];
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int findd(int node){
    if(father[node] == node) return node;
    return findd(father[node]);
}
void unionn(int x, int y){
    int a = findd(x), b = findd(y);
    if(a == b) return ;
    if(sizee[a] > sizee[b]) swap(a, b);
    sizee[b] += sizee[a];
    father[a] = b;
}
int main(){
    int n, m; fin >> n >> m;
    for(int i = 1; i <= n; ++i) father[i] = i;
    for(int i = 1; i <= m; ++i){
        int type, x, y;
        fin >> type >> x >> y;
        if(type == 1) unionn(x, y);
        else {
            if(findd(x) == findd(y)) fout << "DA";
            else fout << "NU";
            fout << '\n';
        }
    }
    return 0;
}