#include <iostream>
#include <fstream>
using namespace std;

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

const int NMAX = 1e5;
int p[NMAX + 1], sz[NMAX + 1];

int Find(int x) {
    while (x != p[x]) {
        x = p[x];
    }
    return x;
}
void Union(int x, int y) {
    x = Find(x);
    y = Find(y);
    if (sz[x] > sz[y]) {
        p[y] = x;
        sz[x] += sz[y];
    } else {
        p[x] = y;
        sz[y] += sz[x];
    }
}

int main() {
    int n, q;
    f >> n >> q;
    for (int i = 1; i <= n; i ++) {
        p[i] = i;
        sz[i] = i;
    }

    for (int i = 1; i <= q; i ++) {
        int op, x, y;
        f >> op >> x >> y;
        if (op == 1){
            Union(x, y);
        } else {
            if(Find(x) != Find(y)){
                g << "NU\n";
            } else {
                g << "DA\n"; 
            }
        }
    }
    return 0;
}