#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[100001],i,n,q,x,t,y;
int find(int nod)
{
	while(tata[nod]!=nod) nod=tata[nod];
	return tata[nod];
}
void Union(int x, int y)
{
    int tx,ty;
    tx=find(x);
    ty=find(y);
    if(tx!=ty)tata[ty]=tx;
    else tata[tx]=ty;
}
int main()
{
    fin>>n>>q;
    for(i=1;i<=n;++i) tata[i]=i;
    while(q--)
    {
        fin>>t>>x>>y;
        if(t==1) Union(x,y);
        else
        {
            if(find(x)==find(y)) fout<<"DA"<<"\n";
            else fout<<"NU"<<"\n";
        }
    }
    return 0;
}