#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int sef[100001];
int sefsuprem(int nod)
{
    if(sef[nod]==nod)
        return nod;
    else
        return sef[nod]=sefsuprem(sef[nod]);
}
void unire(int nod1, int nod2)
{
    int sef1, sef2;
    sef1=sefsuprem(nod1);
    sef2=sefsuprem(nod2);
    sef[sef2]=sef1;
}


int main()
{
    int n,m,i,tip,x,y,sef1,sef2;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        sef[i]=i;
    for(i=1;i<=m;i++)
    {
        cin>>tip>>x>>y;
        if(tip==1)
            unire(x,y);
        else
        {
            sef1=sefsuprem(x);
            sef2=sefsuprem(y);
            if(sef1==sef2)
                cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
    return 0;
}