#include <bits/stdc++.h>
#define nmax 250005
#define oo 2e9
using namespace std;

ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n, m, t[100005];

void Union(int x, int y)
{
    t[x] = y;
}
int Find(int x)
{
    int rad = x, y;
    while(t[rad] != 0)
        rad = t[rad];
    while(rad != x)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}
int main()
{
    int i, j, x, y, task;
    in >> n >> m;
    for(i = 1; i <= m; i++)
    {
        in >> task >> x >> y;
        if(task == 1) Union(x, y);
        else
        {
            x = Find(x);
            y = Find(y);
            if(x != y) out << "NU" << "\n";
            else out << "DA" << "\n";
        }
    }
    return 0;
}