#include <fstream>

#define NMAX 100005

using namespace std;

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

int n, m;
int sz[NMAX];
int tata[NMAX];
int cod, x, y;
int i;

void make_set(int);
void union_sets(int, int);
int find_set(int);

signed main()
{
    fin >>n>>m;
    for (i = 1; i <= n; ++i)
        make_set(i);

    for (i = 1; i <= m; ++i)
    {
        fin >>cod>>x>>y;
        if (cod == 1)
            union_sets(x, y);
        else
            fout <<(find_set(x) == find_set(y)? "DA": "NU")<<'\n';
    }
    fout.close();
    return 0;
}

void union_sets(int x, int y)
{
    x = find_set(x);
    y = find_set(y);

    if (x != y)
    {
        if (sz[x] < sz[y])
            swap(x, y);
        tata[y] = x;
        sz[x] += y;
    }
}

int find_set(int x)
{
    if (tata[x] == x)
        return x;

    return (tata[x] = find_set(tata[x]));
}

void make_set(int vf)
{
    tata[vf] = vf;
    sz[vf] = 0;
}