#include <iostream>
#include <fstream>
using namespace std;


ifstream fin("disjoint.in");
ofstream fout("disjoint.out");


int n,m;
int t[100005];


void Union(int x,int y)
{
    t[x]=y;
}


int Find(int x)
{
    int rad=x;
    while(t[rad]>0)
    {
        rad=t[rad];
    }
    return rad;
}


int main()
{
    int op,x,y,r1,r2;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        r1=Find(x);
        r2=Find(y);
        if(op==1)
        {
            if(r1!=r2)
            {
                Union(r1,r2);
            }
        }
        else
        {
            if(r1==r2)
            {
                fout<<"DA"<<"\n";
            }
            else
            {
                fout<<"NU"<<"\n";
            }
        }
    }
    return 0;
}