#include <bits/stdc++.h>
#define N_MAX 100005
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int tata[N_MAX],n,m;
int father(int x)
{
    while(tata[x]!=x)
    {
        x=tata[x];
    }
    return tata[x];
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=n; i++)
    {
        tata[i]=i;
    }
    for(int i=0; i<m; i++)
    {
        int x,y,z;
        in >> x >> y >> z;
        if(x==1)
        {
            y=father(y);
            z=father(z);
            tata[y]=z;
        }
        else
        {
            if(father(y)==father(z))
                out << "DA\n";
            else
                out << "NU\n";
        }
    }
    return 0;
}