#include <bits/stdc++.h>

using namespace std;

int n,m,t[100005],op,a,b;

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

int sef(int x)
{
    if(x == t[x])
        return t[x];
    return t[x] = sef(t[x]);
}

void reunire(int x,int y)
{
    int s1 = sef(x);
    int s2 = sef(y);
    t[s2] = s1;
}

bool intr(int x,int y)
{
    return (sef(x) == sef(y));
}

int main()
{
    in>>n>>m;
    for (int i = 1;i <= n;++i)
         t[i] = i;
    for (int i = 1;i <= m;++i)
         {in>>op>>a>>b;
         if (op == 1)
             reunire(a,b);
         else
             {bool da = intr(a,b);
             (da == true) ? out<<"DA\n" : out<<"NU\n";}}
    return 0;
}