#include <bits/stdc++.h>

using namespace std;

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

int n , m , t[100005] , rang[100005];

int radacina(int nod)
{
    if (t[nod] == 0)
        return nod;
    else
    {
        int k = radacina(t[nod]);
        t[nod] = k;
        return k;
    }
}

int unire(int a , int b)
{
    int ra = radacina(a);
    int rb = radacina(b);
    if(rang[ra] > rang[rb])
        t[a] = b;
    else
        t[b] = a;
    if(rang[ra] < rang[rb])
        rang[rb]++;

}
int main()
{
    f >> n >> m;

    for ( int i = 1 ; i <= m ; i++)
        {
            int c , x , y;
            f >> c >> x >> y;
            if( c == 1)
            {
                if(radacina (x) != radacina(y))
                    unire(x , y);
            }
            if( c == 2)
            {
                if( radacina(x) == radacina(y))
                    g << "DA" << '\n';
                else
                    g << "NU" << '\n';
            }
        }

}