#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tata[20005];
int n,m,op;
int find_father(int node)
{
    if(tata[node]!=node)
    tata[node]=find_father(tata[node]);
    return tata[node];
}
void unite(int x,int y)
{
    tata[find_father(x)]=find_father(y);

}
int main()
{
    int i,x,y;
   f>>n>>m;
   for(i=1;i<=n;i++)
   {
       tata[i]=i;
   }
   for(i=0;i<m;i++)
    {
        f>>op>>x>>y;
        if(op==1)
        unite(x,y);
        else if(find_father(x)==find_father(y))

            g<<"DA"<<'\n';
            else g<<"NU"<<'\n';

    }
    f.close();
    g.close();
    return 0;
}