#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i,x,y,tata[100001],rx,ry,t;
int radacina(int x)
{
    while(tata[x]>0)
        x=tata[x];
    return x;
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        tata[i]=-1;
    }
    for(i=1; i<=m; i++)
    {
        fin>>t>>x>>y;
        if(t==1)
        {
            rx=radacina(x);
            ry=radacina(y);
            if(rx!=ry)
                if(tata[rx]<tata[ry])
                {
                    ///rx devine radacina arborelui unificat
                    tata[rx]+=tata[ry];
                    tata[ry]=rx;
                }
                else
                {
                    tata[ry]+=tata[rx];
                    tata[rx]=ry;
                }

        }
        else{
            rx=radacina(x);
            ry=radacina(y);
            if(rx==ry)
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}