#include <fstream>
using namespace std;

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

const int NMAX = 100001;
int n, m, ROOT[NMAX], GR[NMAX];
int find(int x);
void unite (int x, int y);
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        ROOT[i] = i;
        GR[i] = 1;
    }

    int x,y,q;
    for (int i = 1; i <= m; ++i)
    {
        fin >> q >> x >> y;
        if (q == 1) unite(x,y);
        else {
            if (find(x) == find(y)) fout << "DA" << ' ';
            else fout << "NU" << ' ';
        }
    }
    return 0;
}
int find (int x)
{
    int copie_x = x;
    while (ROOT[x] != x)
    {
        x = ROOT[x];
    }
    int root = x;
    x = copie_x;
    while (ROOT[x] != x)
    {
        x = ROOT[x];
        ROOT[x] = root;
    }
    return root;
}

void unite(int x, int y)
{
    if (GR[x] > GR[y])
    {
        ROOT[y] = x;
        GR[x] += GR[y];
    }
    else {
        ROOT[x] = y;
        GR[y] += GR[x];
    }
}