#include <bits/stdc++.h>

using namespace std;

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

vector <int> par;
vector <int> sz;

void initialize (int n)
{
    par.resize(n+1);
    sz.resize(n+1, 1);
    for(int i=1;i<=n;++i)
        par[i]=i;
}

int Find(int nod)
{
    if(par[nod]==nod)
        return nod;
    return par[nod] = Find(par[nod]);
}

void unite(int nod1, int nod2)
{
    int n1 = Find(nod1), n2 = Find(nod2);
    if(sz[n1] < sz[n2]) swap(n1, n2);
    if(n1 != n2)
    {
        par[n2] = n1, sz[n1]+=sz[n2];
    }
}

int main()
{
    int n, m, cod, x, y;
    int i;
    fin >> n >> m;
    initialize(n);
    for(i=1;i<=m;++i)
    {
        fin>>cod>>x>>y;
        if(cod == 1)
            unite(x, y);
        else
            fout<<(Find(x) == Find(y) ? "DA\n" : "NU\n");
    }
    return 0;
}