#include <iostream>
#include <fstream>
#define nmax 100005

using namespace std;

int n, m, card[nmax], parent[nmax];

void set_start(int n){
    for(int i=1; i<=n; i++){
        card[i] = 1;
        parent[i] = i;
    }
}

void change_parent(int oldp, int newp){
    for(int i=1; i<=n; i++){
        if(parent[i] == oldp)
            parent[i] = newp;
    }
}

void solve(){
    int p, x, y;
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f >> n >> m;
    set_start(n);
    for(int i=1; i<=m; i++){
        f >> p >> x >> y;
        if(p == 1){
            if(card[x] >= card[y]){
                parent[y] = x;
                card[x] += card[y];
                change_parent(y, x);
            }
            else{
                parent[x] = y;
                card[y] += card[x];
                change_parent(x, y);
            }
        }
        else
            if(parent[x] == parent[y])
                g << "DA\n";
            else
                g << "NU\n";
    }
}

int main()
{
    solve();
    return 0;
}