#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m, t[100005];
void Union(int x, int y)
{
    t[x] = y;
}
int Find(int x)
{
    int y, rad;
    rad = x;
    while(t[rad] != 0)
        rad = t[rad];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}
int main()
{
    ios_base::sync_with_stdio(0);
    fin.tie(0);
    fout.tie(0);
    int i,j,task;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        t[i] = 0;
    while(m--)
    {
        fin >> task >> i >> j;
        i = Find(i);
        j = Find(j);
        if(task == 1)
            Union(i,j);
        else
        {
            if(i == j) fout << "DA" << "\n";
            else fout << "NU";
        }
    }
    return 0;
}