#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,t[100001],h[100001],op,x,y;

int radacina(int a)
{
    if(a==t[a])return a;
    return radacina(t[a]);
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)t[i]=i,h[i]=1;
    int r1,r2,next;
    for(int i=1;i<=m;i++)
    {
        fin>>op>>x>>y;
        // cautam radacinile arborilor
        r1=radacina(x);
        r2=radacina(y);
        if(op==2)
        {
            if(r1==r2)fout<<"DA\n";
            else fout<<"NU\n";
            // compresie - se muta nodurile spre radacina
            while(x!=r1)
            {
                next=t[x];
                t[x]=r1;
                x=next;
            }
            while(y!=r2)
            {
                next=t[y];
                t[y]=r2;
                y=next;
            }
        }
        else
        {
            if(h[r2]<h[r1])t[r2]=r1;
            else
            {
                t[r1]=r2;
                h[r1]++;
            }
        }
    }
}