#include <bits/stdc++.h>


using namespace std;
int parent[100005];
int val[100005];
int Find(int x)
{
    if(parent[x]==x)
        return x;
    return parent[x]=Find(parent[x]);


}
void unite(int x,int y)
{
    x=Find(x);
    y=Find(y);
    if(val[x]<val[y])
        swap(x,y);
    parent[y]=x;
    val[x]+=val[y];
    val[y]=0;

}
int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        parent[i]=i;
        val[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        int cer,a,b;
        cin>>cer>>a>>b;
        if(cer==1)
        {
            unite(a,b);
        }
        else
        {
            a=Find(a);
            b=Find(b);
            if(a==b)
                cout<<"DA"<<'\n';
            else
                cout<<"NU"<<'\n';
        }
    }
    return 0;
}