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

vector <int> graph[100005];
int tata[100005];
int grad[100005];

int findfath( int node)
{
    if (tata[node] == node)
        return node;
    int ans=findfath(tata[node]);
    tata[node]=ans;
    return ans;
}
int main()
{

    int n,m, i;
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f>>n>>m;
    for(i=0;i<n;i++)
    {
        tata[i]=i;
        grad[i]=1;
    }
    for(i=0;i<m;i++)
    {
        int a,x,y;
        f>>a>>x>>y;
        int tx,ty;
        tx=findfath(x);
        ty=findfath(y);
        if (a==1)
        {
        if (tx!=ty)
        {
            if (grad[tx]<grad[ty])
            {
                tata[tx]=ty;
                grad[ty]+=grad[tx];
            }
            else
            {
                tata[ty]=tx;
                grad[tx]+=grad[ty];
            }
        }
        }
        else
        {
            if (tx==ty)
                g<<"DA\n";
            else
                g<<"NU\n";
        }

    }


}