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

#define N 100010
int n, m, x, y, o, p[N];

int fnd(int q){
    if (q == p[q]) return q;
    p[q] = fnd(p[q]);
    return p[q];
}

int main(){
    ifstream cin ("disjoint.in");
    ofstream cout ("disjoint.out");
    cin >> n >> m;
    for (int i=0; i<n; i++) p[i] = i;
    for (int i=0; i<m; i++){
        cin >> o >> x >> y;
        if (o == 1) p[fnd(x)] = fnd(y);
        else cout << (fnd(x) == fnd(y) ? "DA" : "NU") << '\n';
    }
    return 0;
}