#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 1e5;

int n, m, t[NMAX + 1];

inline int findRadac(int x) {
    int radac = x;
    while(radac != t[radac]) radac = t[radac];
    while(x != t[x]) {
        int crt = t[x];
        t[x] = radac;
        x = crt;
    }
    return radac;
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i) t[i] = i;
    for(int i = 1, op, x, y; i <= m; ++i) {
        fin >> op >> x >> y;
        if(op == 1) t[findRadac(x)] = findRadac(y);
        else findRadac(x) == findRadac(y) ? fout << "DA\n" : fout << "NU\n";
    }
    return 0;
}