#include<fstream>

using namespace std;

int rang[100012];
int tata[100012];

int r(int x)
{
    int rad,aux;
    while (tata[x]!=x) x=tata[x];
    rad=x;
    while (tata[x]!=x)
    {
        aux=tata[x];
        tata[x]=rad;
        x=aux;
    }
    return x;
}

void uneste(int x,int y)
{
    if (rang[x]>rang[y]) tata[y]=x;
                else tata[x]=y;
    if (rang[x]==rang[y]) ++rang[y];
}
int n,m;

int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    cin>>n>>m;
    for (int i=1; i<=n; ++i)
    {
        rang[i]=1;
        tata[i]=i;
    }
    while (m--)
    {
        int op,x,y;
        cin>>op>>x>>y;
        if (op==1) uneste(r(x),r(y));
            else cout<<(r(x)==r(y) ? "DA\n" : "NU\n");
    }
    return 0;

}