#include <bits/stdc++.h>

#define N_MAX 100000

using namespace std;

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

int N, M;
int T[N_MAX + 5];

int find(int node)
{
    if(node == T[node]) {
        return node;
    }
    return T[node] = find(T[node]);
}

void unite(int a, int b)
{
    a = find(a);
    b = find(b);
    T[a] = b;
}

int main()
{
    fin >> N >> M;
    for(int i = 1; i <= N; i++) {
        T[i] = i;
    }

    while(M--) {
        int t, x, y;
        fin >> t >> x >> y;
        if(t == 1) {
            unite(x, y);
        }
        else {
            fout << (find(x) == find(y) ? "DA\n" : "NU\n");
        }
    }
    return 0;
}