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

int T[100100], N, M;

int find(int x){
    T[x] = (T[x] == x ? x : find(T[x]));
    return T[x];
}

void unite(int x, int y){
    T[find(x)] = find(y);
}

int main() {
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> N >> M;
    
    for(int i = 1; i <= N; i++){
        T[i] = i;
    }
    
    while(M--){
        int k, x, y;
        cin >> k >> x >> y;
        if(k == 1){
            unite(x,y);
        } else {
            cout << (find(x) == find(y) ? "DA" : "NU") << '\n';
        }
    }
}