#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,type,x,y,t[101],rankk[101],sizee[101];
int find_(int u)
{

    if(t[u]==u)return u;
    return t[u]=find_(t[u]);
}

void merge_(int u, int v)
{
    u=find_(u);
    v=find_(v);
    if(u==v)return;

    if(sizee[u]<sizee[v])
        swap(u,v);
    t[v]=u;
    sizee[u]+=sizee[v];
    if(rankk[u]==rankk[v])rankk[u]++;
}


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