#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

int reprezentant(int x,vector<int>parinte)
{
    if(x==parinte[x])
        return x;
    else return parinte[x]=reprezentant(parinte[x],parinte);
}
void uneste(int a, int b, vector <int> &parinte, vector <int> &adancime)
{
    int rep_a=reprezentant(a,parinte);
    int rep_b=reprezentant(b,parinte);
    if(adancime[rep_a]<adancime[rep_b])
        parinte[rep_a]=rep_b;
    else parinte[rep_b]=rep_a;
    if(adancime[rep_a]==adancime[rep_b])
        adancime[rep_a]++;
}
bool verificare(int a, int b, vector<int>parinte)
{
    return reprezentant(a,parinte)==reprezentant(b,parinte);

}
int main()
{
 ifstream f("disjoint.in");
 ofstream g("disjoint.out");
 int n,m,a,b,op;
 f>>n>>m;
 /*vector <int> comp(n+1);
 for(int i=1;i<=n;i++)
     comp[i]=i;
 vector < vector <int> > noduri_comp(n+1);
 for(int i=1;i<=n;i++)
    noduri_comp[i].push_back(i);
 for(int i=0;i<m;i++)
 {
     f>>op>>a>>b;
     if(op==1)
     {
         a=comp[a];
         b=comp[b];
         if(noduri_comp[a].size() > noduri_comp[b].size())
            swap(a, b);

             for(int j=0;j<noduri_comp[a].size();j++)
                 {
                     comp[noduri_comp[a][j]]=comp[b];
                     noduri_comp[b].push_back(noduri_comp[a][j]);
                 }
                 noduri_comp[a].clear();

     }
     else
     {
         if(comp[a]==comp[b])
            g<<"DA"<<"\n";
         else g<<"NU"<<"\n";
     }
 }*/
 vector <int> parinte(n+1);
 for(int i=1;i<=n;i++)
    parinte[i]=i;
 vector <int> adancime(n+1,0);
 for(int i=0;i<m;i++)
 {
     f>>op>>a>>b;
     if(op==1)
        uneste(a,b,parinte,adancime);
     else
     {
         if(verificare(a,b,parinte))
            g<<"DA"<<"\n";
         else g<<"NU"<<"\n";
     }
 }
 f.close();
 g.close();


    return 0;
}