#include <fstream>
using namespace std;

ifstream is("disjoint.in");
ofstream os("disjoint.out");

int n, m;
int q, i, j;
int t[100001], h[100001];

int FIND(int x);
void UNION(int x, int y);

int main()
{
    is >> n >> m;
    for ( int i = 1; i <= n; ++i )
        t[i] = i;
    while ( m-- )
    {
        is >> q >> i >> j;
        if ( q == 1 )
            UNION(FIND(i), FIND(j));
        else
        {
            if ( FIND(i) == FIND(j) )
                os << "DA\n";
            else
                os << "NU\n";
        }
    }
    is.close();
    os.close();
    return 0;
}

int FIND(int x)
{
    if ( t[x] == x ) return x;
    return t[x] = FIND(t[x]);
}

void UNION(int x, int y)
{
    if ( h[x] > h[y] )
        t[y] = x;
    else
    {
        t[x] = y;
        if ( h[x] == h[y] )
            ++h[y];
    }
}