#include <fstream>

using namespace std;

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

const int N = 100001;

int n, m, t[N], nr[N];

int radacina(int x) {
    if (t[x] == 0) return x;
    t[x] = radacina(t[x]);
    return t[x];
}

void query(int x, int y) {
    if (radacina(x) == radacina(y)) out << "DA\n";
    else out << "NU\n";
}

void reunion(int x, int y) {
    int rx = radacina(x), ry = radacina(y);

    if (nr[rx] > nr[ry]) {
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
    else {
        t[rx] = ry;
        nr[ry] += nr[rx];
    }
}

int main()
{
    in >> n >> m;

    std::fill(nr + 1, nr + n + 1, 1);
    int op, x, y;
    for (int i = 0; i < m; i++) {
        in >> op >> x >> y;
        if (op == 1) reunion(x, y);
        if (op == 2) query(x, y);
    }
    in.close();
    out.close();
}