#include <bits/stdc++.h>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,V[100020];
int radacina(int x)
{
    if(x==V[x])
        return x;
    else
        return radacina(V[x]);
}
void Leaga(int x,int y)
{
    if(x>y)
        V[x]=y;
    else
        V[y]=x;
}
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        V[i]=i;
    while(m--)
    {
        int cer,x,y;
        f>>cer>>x>>y;
        assert(cer==1||cer==2);
        int x1=radacina(x);
        int y1=radacina(y);
        if(cer==2)
        {
            if(x1==y1)
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
        {
            if(x1!=y1)
                Leaga(x1,y1);
        }
    }



    return 0;

}