#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,n,m,tata[100001],adanc[100001],radx,rady,cer,x,y;
void completeaza()
{
    for(i=1;i<=n;i++)
        tata[i]=i;
}
int rad(int i)
{
    while(tata[i]!=i)
        i=tata[i];
    return i;
}
void solve(int x,int y)
{
        radx=rad(x);
        rady=rad(y);
        if(radx!=rady)
        {
            if(adanc[radx]==adanc[rady])
            {
                tata[radx]=rady;
                adanc[rady]++;
            }
            else
                if(adanc[radx]<adanc[rady])
                    tata[radx]=rady;
                else tata[rady]=radx;
        }
}
int main()
{

    f>>n>>m;
    completeaza();
    for(i=1;i<=m;i++)
    {
        f>>cer>>x>>y;
        if(cer==1)
            solve(x,y);
        else
            if(rad(x)==rad(y))
                g<<"DA\n";
            else g<<"NU\n";
    }

    return 0;
}