#include <bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m;
int comp[100005];
vector<int> dsu[100005];
void dsu_merge(int c1,int c2)
{
    if(dsu[c1].size()<dsu[c2].size())
        swap(c1,c2);
    for(int i:dsu[c2])
    {
        comp[i]=c1;
        dsu[c1].push_back(i);
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        comp[i]=i;
        dsu[i].push_back(i);
    }
    while(m--)
    {
        int tip;
        fin>>tip;
        int x,y;
        fin>>x>>y;
        if(tip==1)
        {
            dsu_merge(comp[x],comp[y]);
            continue;
        }
        if(comp[x]==comp[y])fout<<"DA\n";
        else
            fout<<"NU\n";
    }
    return 0;
}