#include <fstream>
using namespace std;

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

int i, parinte [100005], n, m, x, a, b;

int pmd ( int x )
{
    if ( parinte [x] == x )
    {
        return x;
    }

    return parinte [x] = pmd ( parinte [x] );

}



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

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

    for ( i=1; i<=m; i++)
    {
        f>>x>>a>>b;

        if ( x ==  1 )
        {
            parinte [ a ] = parinte [ b ];
            pmd ( a );
        }

        else
        {
            if ( parinte [ a ] == parinte [ b ] )
            {
                g<<"DA"<<'\n';
            }
            else
            {
                g<<"NU"<<'\n';
            }
        }

        /*for ( int i1 = 1 ; i1 <= n; i1++ )
        /
            g<<parinte[i1]<<" ";
        }

        g<<'\n';
        */

    }

    return 0;
}