#include <unordered_map>
#include <iostream>
#include <fstream>

using namespace std;

int n;
unordered_map<int, int> parent,sizes;
void init()
{
    for(int i=1; i<=n; i++)
    {
        parent[i]=i;
        sizes[i]=1;
    }
}

int find(int n)
{
    if(n==parent[n])
        return n;
    return parent[n]=find(parent[n]);
}

void unite(int x, int y)
{
    x=find(x);
    y=find(y);
    if(x==y)
        return;
    if(sizes[y]>sizes[x])
        swap(x, y);
    parent[y]=x;
    sizes[x]+=sizes[y];
}
int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int m,x,y,cer;
    cin>>n>>m;
    init();
    for(int i=0; i<m; i++)
    {
        cin>>cer>>x>>y;
        if(cer==1)
            unite(x, y);
        else
        {
            if(find(x)==find(y))
                cout<<"DA"<<'\n';
            else
                cout<<"NU"<<'\n';
        }
    }

    return 0;
}