#include <bits/stdc++.h>

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

int find_wcompression(int x)
{
    int r=x,aux;
    while(t[r]!=r)
        r=t[r];
    while(t[x]!=r)
    {
        aux=t[x];
        t[x]=r;
        x=aux;
    }
    return r;
}

void union_pondered(int x,int y)
{
    if(x==y)return;
    if(h[x]<h[y])
    {
        t[x]=y;
    }
    else
    {
        t[y]=x;
        if(h[x]==h[y])h[x]++;
    }
}

int main()
{
    int cod,x,y,r1,r2;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        h[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1) // reunion
        {
            r1=find_wcompression(x);
            r2=find_wcompression(y);
            union_pondered(r1,r2);
        }
        else // find root
        {
            if(find_wcompression(x)==find_wcompression(y))
                fout<<"DA\n";
            else fout<<"NU\n";
        }
    }
}