#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("dijoint.out");

const int Dim = 10000;

int n, m;
int x, y, z;
int t[Dim];
int h[Dim];

void Union(int r1, int r2);
int Find(int x);

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        t[i] = i;
    while (m)
    {
        m--;
        fin >> z >>  x >> y;
        if ( z == 1 )
        {
            Union( x, y );
        }
        if ( z == 2 )
        {
            if ( Find(x) == Find(y) )
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }
    return 0;
}


void Union(int r1, int r2)
{
    if ( h[r1] > h[r2] )
    {
        t[r2] = r1;
    }
    else
    {
        t[r1] = r2;
        if ( h[r1] == h[r2] )
            h[r2]++;
    }
}
int Find(int x)
{
    if ( x == t[x] )
        return x;
    return t[x] = Find(t[x]);
}