#include <bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int P[100001];
int n,m;
int radacina(int nod)
{
    while(P[nod]!=nod)
        nod=P[nod];
    return nod;
}
int q(int nod)
{
    if(P[nod]!=nod)
        P[nod]=q(P[nod]);
    return P[nod];
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        P[i]=i;
    for(int i=1;i<=m;i++)
    {
        int op,x,y;
        fin>>op>>x>>y;
        if(op==1)
                P[radacina(x)]=radacina(y);
        else
        {
            P[x]=q(x);
            P[y]=q(y);
            if(P[x]==P[y])
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}