#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, q, dad[100001], rang[100001], tip, a, b;
int find1(int x)
{
    if(dad[x]==x)
        return x;
    return dad[x]=find1(dad[x]);
}
void union1(int x, int y)
{
    if(rang[x]>rang[y])
        dad[y]=x, rang[x]+=rang[y];
    else
        dad[x]=y, rang[y]+=rang[x];
}
int main()
{
    f>>n>>q;
    for(int i=1; i<=n; i++)
        dad[i]=i, rang[i]=1; ///initial, tatal lui i este chiar i, iar rangul este 1
    for(; q; q--)
    {
        f>>tip>>a>>b;
        if(tip==1)
            union1(find1(a), find1(b)); ///reunim multimile in care se afla elementele
        else
        {
            if(find1(a)==find1(b)) ///verificare op. tip 2 se afla / nu se afla in multime ambele
                g<<"DA";
            else
                g<<"NU";
            g<<'\n';
        }
    }

    ///Complexitate: O(n * log n)
    return 0;
}