#include <fstream>
#include <iostream>

using namespace std;

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

int n, m;

int t[100003];
int r[100003];

int radacina(int x)
{
    int rad=x;

    while(t[x]!=x)
    {
        rad=t[x];
        x=t[x];
    }

    int temp;

    while(t[x]!=x)
    {
        temp=t[x];

        t[x]=rad;

        x=temp;
    }

    //cout << rad << '\n';

    return rad;
}

void uneste(int x, int y)
{
    int radx=radacina(x);
    int rady=radacina(y);

    if(r[radx] < r[rady])
        t[radx]=rady;
    else
        t[rady]=radx;

    if(r[radx]==r[rady])
        r[radx]++;
}

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

    for(int i=1; i<=n; i++)
    {
        t[i]=i;
        r[i]=1;
    }

    for(int i=1; i<=m; i++)
    {
        int cod, x, y;

        fin >> cod >> x >> y;

        if(cod==1)
            uneste(x, y);
        if(cod==2)
        {
            if(radacina(x)==radacina(y))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }

    return 0;
}