#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int n,m,x,y,cod,i;
int p[100001];
int parinte(int nod)
{
    if(p[nod]==nod) return nod;
    else return p[nod]=parinte(p[nod]);
}
void unite(int x,int y)
{
    p[parinte(x)]=parinte(y);
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++) p[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>cod>>x>>y;
        if(cod==1)
        {

            int drumx=parinte(x);
            int drumy=parinte(y);
            if(parinte(x)!=parinte(y)) unite(x,y);
        }
        else
            if(parinte(x)!=parinte(y))fout<<"NU"<<'\n';
            else fout<<"DA"<<'\n';
    }
    return 0;
}