#include <fstream>

#define NMAX 100001
using namespace std;

int T[NMAX], H[NMAX];

int rep(int nod) {
    while (T[nod] != nod)
        nod = T[nod];
    return nod;
}

void compresie(int nod, int r) {
    int tata;

    while (T[nod] != nod) {
        tata = T[nod];
        T[nod] = r;
        nod = tata;
    }
}

bool interogare(int x, int y) {
    int a, b;

    a = rep(x);
    b = rep(y);

    compresie(x, a);
    compresie(y, b);

    if (a == b)
        return 1;
    return 0;
}

void reuniune(int x, int y) {
    int a, b;

    a = rep(x);
    b = rep(y);

    if (H[a] == H[b]) {
        T[a] = b;
        H[b]++;
    }
    else if (H[a] < H[b])
            T[a] = b;
        else
            T[b] = a;
}

int main() {
    int i, n, m;

    ifstream in("disjoint.in");
    in >> n >> m;

    for (i = 1; i <= n; i++)
        T[i] = i;

    int t, x, y, ok;
    ofstream out("disjoint.out");
    for (i = 1; i <= m; i++) {
        in >> t >> x >> y;
        if (t == 1)
            reuniune (x, y);
        else {
            ok = interogare (x, y);
            if (!ok)
                out << "NU\n";
            else out << "DA\n";
        }
    }
    out.close();
    in.close();

    return 0;
}