#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,i,co,k,x,y,t1,t2,tata[100100];
int findt(int x)
{
    while(tata[x]>0)
        x=tata[x];
    return x;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        tata[i]=-1;
    for(k=1;k<=m;k++)
    {
        fin>>co>>x>>y;
            t1=findt(x);
            t2=findt(y);
        if(co==1)
        {
            if(tata[t1]>tata[t2])
            {
                tata[t2]+=tata[t1];
                tata[t1]=t2;
            }
            else
            {
                tata[t1]+=tata[t2];
                tata[t2]=t1;
            }
        }
        else
        {
            if(t1==t2)
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
        }
    }
    return 0;
}