#include <bits/stdc++.h>
using namespace std;

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

int n , m , t[100005];

void Union(int x , int y)
{
    t[y] = x;
}

int Find(int x)
{
    int rad = x , y;
    while(t[rad] != 0)
        rad = t[rad];
    ///comprimarea drumului
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

int main()
{
    int i , j , k , op;
    fin >> n >> m;
    for(k = 1;k <= m;k++)
    {
        fin >> op >> i >> j;
        i = Find(i);
        j = Find(j);
        if(op == 1)
        {
            if(i != j) Union(i , j);
        }
        else
        {
            if(i == j) fout << "DA\n";
            else fout << "NU\n";
        }
    }
    return 0;
}