#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int MAXN = 1 * 1e5 + 5;
int father[MAXN], sizee[MAXN];
int findd(int node){
    if(node == father[node]) return node;
    return father[node] = findd(father[node]);
}
void unionn(int x, int y){
    int a = findd(x), b = findd(y);
    if(sizee[a] < sizee[b]) swap(a , b);
    father[b] = a;
    sizee[a] += sizee[b];

}
int main()
{
    int n, m; fin >> n >> m;
    for(int i = 1; i <= n; ++i) sizee[i] = 1, father[i] = i;
    for(int i = 1; i <= m; ++i){
        int x, y, z; fin >> x >> y >> z;
        if(x == 1) unionn(y, z);
        else{
            if(findd(y) == findd(z)) fout << "DA";
            else fout << "NU";
            fout << '\n';
        }
    }
    return 0;
}