#include <bits/stdc++.h>

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

int t[100005], n, m;

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;
}

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

int main()
{
    Citire();
    return 0;
}