#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
struct DSU
{
    int N;
    vector<int>parent,sizes;
    void init(int n)
    {
        N=n;
        parent.resize(N+1);
        sizes.resize(N+1);
        for(int i=1;i<=n;i++)
        {
            parent[i]=i;
            sizes[i]=1;
        }
    }
    int find(int u)
    {
        if(u==parent[u])
            return u;
        return parent[u]=find(parent[u]);
    }
    void unite(int u,int v)
    {
        u=find(u);
        v=find(v);
        if(u==v)
            return;
        if(sizes[v]>sizes[u])
            swap(u,v);
        parent[v]=u;
        sizes[u]+=sizes[v];
    }
};
int main()
{
    DSU dsu;
    int n,m,x,y,i,t;
    cin>>n>>m;
    dsu.init(n);
    for(i=1;i<=m;i++)
    {
        cin>>t>>x>>y;
        if(t==1)
            dsu.unite(x,y);
        else
            {
                if(dsu.find(x)==dsu.find(y))
                    cout<<"DA"<<'\n';
                else
                    cout<<"NU"<<'\n';
            }
    }

    return 0;
}