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

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

int ids[100001];
int sz[100001];


int find(int i) {
    if (ids[i] == i) {
        return i;
    }

    return ids[i] = find(ids[i]);
}

void unify(int i, int j) {
    int r1 = find(i);
    int r2 = find(j);

    if (r1 == r2) return;

    if (sz[r1] > sz[r2]) {
        ids[r2] = r1;
    } else {
        ids[r1] = r2;
    }
}



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

    for (int i = 1; i <= n; i++) {
        ids[i] = i;
    }

    while (m--) {
        int t, x, y;
        in >> t >> x >> y;

        if (t == 1) {
            unify(x, y);
        } else if (t == 2) {
            int r1 = find(x);
            int r2 = find(y);

            if (r1 == r2) {
                out << "DA\n";
            } else {
                out << "NU\n";
            }
        }
    }
}