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