#include <bits/stdc++.h>
using namespace std;
int parent[100005];
int find(int x)
{
    if(x==parent[x])
        return x;
    return parent[x]=find(parent[x]);
}
void unite(int x, int y)
{
    x=find(x);y=find(y);
    if(x!=y)
    {
        parent[x]=y;
    }
}
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;
    }
    while(m--)
    {
        int op,x,y;
        cin>>op>>x>>y;
        if(op==1)
        {
            unite(x,y);
        }
        if(op==2)
        {
            if(find(x)==find(y))
                cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
}