#include<bits/stdc++.h>

using namespace std;
typedef int var;

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

#define MAXN 100005

var Set[MAXN];
var Size[MAXN];
vector<var> List[MAXN];

void Merge(var what, var where) {
    while(!List[what].empty()) {
        var node = List[what].back();
        List[what].pop_back();

        Set[node] = where;
        List[where].push_back(node);
    }
    Size[where] += Size[what];
    Size[what] = 0;
}

void Union(var r1, var r2) {
    r1 = Set[r1];
    r2 = Set[r2];

    if(Size[r1] < Size[r2])
        Merge(r1, r2);
     else
        Merge(r2, r1);

}

void Init(var n) {
    for(var i=1; i<=n; i++) {
        Set[i] = i;
        List[i].push_back(i);
    }
}

int main() {

    var n, m, type, a, b;
    fin >> n >> m;
    Init(n);

    while(m--) {
        fin >> type >> a >> b;
        if(type == 1) Union(a, b);
        else fout << ( (Set[a] == Set[b]) ? "DA\n" : "NU\n" );
    }
    return 0;
}