#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int NMAX=100005;
int n,t[NMAX],rg[NMAX],m,task,x,y;
int find_(int nod)
{
    int r,y;
    r=nod;
    while(nod!=t[nod])
        nod=t[nod];
    for(; r!=t[r];)
    {
        y=t[r];
        t[r]=nod;
        r=y;
    }
    return nod;
}
void union_(int x,int y)
{
    if(rg[x]>rg[y])
        t[y]=x;
    else
    {
        t[x]=y;
        if(rg[x]==rg[y])
            rg[y]++;
    }
}
int main()
{
    cin>>n;
    cin>>m;
    for(int i=1; i<=n; i++)
    {
        t[i]=i;
        rg[i]=1;
    }
    for(int i=1; i<=m; i++)
    {
        cin>>task>>x>>y;
        int tx=find_(x);
        int ty=find_(y);
        if(task==1)
        {

            if(tx!=ty)
                union_(tx,ty);
        }
        else
            cout<<((tx!=ty)?"NU":"DA")<<endl;
    }
    return 0;
}