#include <bits/stdc++.h>

#define MAXN    100005

std::ifstream input ("disjoint.in");
std::ofstream output("disjoint.out");

int N, M;
int rang[MAXN], parent[MAXN];

int _find(int x) {
    if (parent[x] != x) return parent[x] = _find(parent[x]);
    return x;
}
void _union(int x, int y) {
    if (x == y) return;
    if (rang[x] > rang[y]) parent[y] = x;
    else                   parent[x] = y;
    if (rang[x] == rang[y]) ++ rang[y];
}
void _query(int x, int y) {
    output << (_find(x) == _find(y) ? "DA\n" : "NU\n");
}

int main()
{
    input >> N >> M;
    for (int i=1; i<=N; ++i) parent[i] = i;
    for (int i=1, cod, x, y; i<=M; ++i) {
        input >> cod >> x >> y;
        if (cod == 1) _union(_find(x), _find(y));
        else          _query(x, y);
    }

    return 0;
}