#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

vector <int>t;
vector <int>h;
void init(int n)
{

    for(int i=1; i<=n; i++) t[i]=i, h[i]=0;
}
int Find(int x)
{

    if(t[x]==x) return x;
    t[x]=Find(t[x]);
    return t[x];
}
void Union(int x, int y)
{
    int a=Find(x), b=Find(y);
    if(h[b]>h[a]) t[a]=b;
    else if(h[b]<h[a]) t[b]=a;
         else if(a!=b) {t[b]=a; h[a]++;}
}
int main()
{
    int n, m, operatie, x, y;
    f>>n>>m;
    t.resize(n+1, 0);
    h.resize(n+1, 0);
    init(n);
    for(int i = 0; i < m; i++)
    {
        f>>operatie>>x>>y;
        if(operatie==1)
        {
            Union(x,y);
        }
        else
        {
            if(Find(x)==Find(y))
                g<<"DA"<<endl;
            else
                g<<"NU"<<endl;
        }
    }
    return 0;

}