#include <fstream>
#define M 100005
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int t[M],rt[M],i,n,m,cer,x,y;
int rad(int x)
{
    int r,y;
    r=x;
    while(t[r]!=0)r=t[r];
    while(t[x]!=0)
    {
        y=t[x];t[x]=r;x=y;
    }
    return r;
}
void reunire(int x, int y)
{
    if(rt[x]>rt[y])t[y]=x;
    else t[x]=y;
    if(rt[x]==rt[y])rt[y]++;
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>cer>>x>>y;
        if(cer==2){if(rad(x)==rad(y))g<<"DA"<<'\n';
        else g<<"NU"<<'\n';}
        else reunire(rad(x),rad(y));
    }
    return 0;
}