#include <bits/stdc++.h>
#define NMAX 100020
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int DAD[NMAX],RANG[NMAX];
int x,y,cod;
int find_(int x)
{
    int r,y;
    for(r=x;DAD[r]!=r;r=DAD[r]);

    while(DAD[x]!=x)
    {
        y=DAD[x];
        DAD[x]=r;
        x=y;
    }
    return r;
}
void unite(int x, int y)
{
    if(RANG[x]>RANG[y])
        DAD[y]=x;
    else DAD[x]=y;

    if(RANG[x]==RANG[y])++RANG[y];
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)
    {
        DAD[i]=i;
        RANG[i]=1;
    }
    for(int i=1;i<=m;++i)
    {
        fin>>cod>>x>>y;
        if(cod==2)
        {
            if(find_(x)==find_(y))fout<<"DA"<<"\n";
            else fout<<"NU"<<"\n";
        }
        else unite(find_(x),find_(y));
    }
    return 0;
}