#include <bits/stdc++.h>
#define P 1999999973
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];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

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