#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int par[100005];

int rad(int x)
{
    while(x != par[x])
        x = par[x];
}

void schimb_leg(int x, int sef)
{
    int b;
    while(x != sef)
    {
        b = par[x];
        par[x] = sef;
        x = b;
    }
}

int main()
{
    int cod, x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; i ++)
        par[i] = i;

    for(int i = 1; i <= m; i ++)
    {
        fin >> cod >> x >> y;
        if(cod == 1)
        {
            schimb_leg(x, rad(x));
            x = rad(x);
            schimb_leg(y, rad(y));
            y = rad(y);
            par[y] = x;

        }
        else if(cod == 2)
        {
            if(rad(x) == rad(y))
                fout << "DA" << '\n';
            else fout << "NU" << '\n';
        }

    }
    return 0;
}