#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");

int n,m,tata[100010],nivel[100010];
int c,x,y;

int bigdaddy(int dad)
{
    if(tata[dad]==0)
        return dad;
    return bigdaddy(tata[dad]);
}
void mergedads()
{
    int a=bigdaddy(x);
    int b=bigdaddy(y);
    if(nivel[a]>nivel[b])
    {
        tata[b]=a;
        nivel[b]=nivel[a]+1;
    }
    else
    {
        tata[a]=b;
        nivel[a]=nivel[b]+1;
    }
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        in>>c>>x>>y;
        if(c==1)
        {
            mergedads();
        }
        else
        {
            if(bigdaddy(x)==bigdaddy(y))
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
    return 0;
}