#include <bits/stdc++.h>

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

int N, M, x, y, cod;
int T[100010], R[100010];

int rad(int x)
{
    int r = x, y;
    while(T[r] != r)
        r = T[r];
    while(T[x] != x)
    {
        y = T[x];
        T[x] = r;
        x = y;
    }
    return r;
}

void unite(int x, int y)
{
    if(R[x] > R[y])
        T[y] = x;
    else
        T[x] = y;

    if(R[x] == R[y])
        R[y] ++;
}

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

    for(int i = 1; i <= M; i ++)
    {
        f >> cod >> x >> y;
        if(cod == 1)
            unite(rad(x), rad(y));
        else
        {
            if(rad(x) == rad(y))
                g << "DA" << '\n';
            else
                g << "NU" << '\n';
        }
    }
    return 0;
}