#include <bits/stdc++.h>
#define nmax 100001

using namespace std;

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

int n,m,t[nmax];

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 solve()
{
    int op,x,y;
    fin >> n >> m;
    while(m--)
    {
        fin >> op >> x >> y;
        x = Find(x);
        y = Find(y);
        if(op == 1) Union(x,y);
        else if(x == y) fout << "DA\n";
        else if(x != y) fout << "NU\n";
    }
}

int main()
{
    solve();
    fin.close();
    fout.close();
    return 0;
}