#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
vector <int> v[100005];
int n, m, op, x, y, fv[100005];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        v[i].push_back(i), fv[i] = i;
    while (m--) {
        fin >> op >> x >> y;
        if (op == 1) {
            int pos = 0;
            for (int i = 1; i <= n; ++i) {
                bool exista = 0;
                int cpos = pos;
                for (int j = 0; j < v[i].size(); ++j)
                    if (v[i][j] == x || v[i][j] == y) {
                        if (pos == 0)
                            pos = i;
                        exista = true;
                    }
                while (cpos > 0 && exista && !v[i].empty()) {
                    v[pos].push_back(v[i].back());
                    fv[v[i].back()] = pos;
                    v[i].pop_back();
                }
            }
            continue;
        }
        fout << (fv[x] == fv[y] ? "DA\n" : "NU\n");
    }
    return 0;
}