#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,t[100010],r[100010];
int Find(int x)
{   int rad;
    for(rad=x;rad!=t[rad];rad=t[rad]);
    while(x!=t[x])
    {   int c=t[x];
        t[x]=rad;
        x=c;
    }
    return rad;
}
void Unite(int x, int y)
{   if(r[x]<r[y]) t[x]=y;
    else t[y]=x;
    if(r[x]==r[y]) r[x]++;
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {   t[i]=i;
        r[i]=1;
    }
    for(int i=1;i<=m;i++)
    {   int cod,x,y;
        f>>cod>>x>>y;
        if(cod==1) Unite(Find(x),Find(y));
        else
        {   if(Find(x)==Find(y)) g<<"DA"<<'\n';
            else g<<"NU"<<'\n';
        }
    }
    return 0;
}