#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int NMAX = 1e5 + 1;
int parent[NMAX], h[NMAX];

int Find(int x)
{
    if(x == parent[x])
        return x;
    return (parent[x] = Find(parent[x]));
}

void Union(int x, int y)
{
    x = Find(x), y = Find(y);
    if(x == y)
        return;
    if(h[x] > h[y])
        parent[y] = x;
    else if(h[x] < h[y])
        parent[x] = y;
    else
        parent[x] = y, h[y]++;
}

int main()
{
    int n, m;
    fin >> n >> m;
    iota(parent + 1, parent + n + 1, 1);
    while(m--)
    {
        int op, x, y;
        fin >> op >> x >> y;
        if(op == 1)
            Union(x, y);
        else
            fout << (Find(x) == Find(y) ? "DA\n" : "NU\n");
    }

    return 0;
}