#include <iostream>
#include <fstream>
#define lim 100004
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,v[lim],cod,x,y;
int find (int x)
{
    if (v[x]==x) return x;
    return v[x]=find (v[x]);
}
void reuniune (int x,int y)
{
    v[find(x)]=find(y);
}
int main()
{
    f>>n>>m;
    for (int i=1;i<=n;i++) v[i]=i;
    for (int i=1;i<=m;i++)
    {
        f>>cod>>x>>y;
        if (cod==1) reuniune(x,y);
        else g<<((find(x)==find(y)) ? "DA\n":"NU\n");
    }
    f.close();
    g.close();
    return 0;
}