#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int T[NMAX],n,m,t,x,y;
int findT(int x)
{
    while (T[x]!=x)
    {
        x=T[x];
    }
    return x;
}
void reunion(int x, int y)
{
    T[x]=y;
}
int main()
{
    f>>n>>m;
    for (int i=1;i<=n;i++)
    {
        T[i]=i;
    }
    for (int i=0;i<m;i++)
    {
        f>>t>>x>>y;
        if (t==1)
        {
            reunion(findT(x), findT(y));
        }
        else
        {
            if (findT(x)==findT(y)) g<<"DA \n";
            else g<<"NU \n";
        }
    }
    return 0;
}