#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5;
int p[NMAX + 5];
int nr[NMAX + 5];

int parent(int x) {
    if (!p[x])
        return x;
    p[x] = parent(p[x]);
    return p[x];
}
void join(int a, int b) {
    a = parent(a);
    b = parent(b);
    if (nr[a] < nr[b]) {
        p[a] = b;
        nr[b] += nr[a];
    }
    else {
        p[b] = a;
        nr[a] += nr[b];
    }
}
string ok(int a, int b) {
    if (parent(a) == parent(b))
        return "DA";
    else
        return "NU";
}
int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n,m,cer,a,b;
    fin >> n >> m;
    for (int i = 1;i <= n;i++)
        nr[i] = 1;
    for (int i = 0;i < m;i++) {
        fin >> cer >> a >> b;
        if (cer == 1)
            join(a, b);
        else
            fout << ok(a, b) << '\n';
    }
    return 0;
}