#include <bits/stdc++.h>

using namespace std;
struct DSU
{
    vector<int>Rank;
    vector<int>Parent;
    DSU(int n)
    {
        Rank.assign(n,1);
        Parent.assign(n,0);
        for(int i=0;i<n;i++)
        Parent[i]=i;
    }
    int getparent(int x)
    {
        if(Parent[x]==x)
        return x;
        return Parent[x]=getparent(Parent[x]);
    }
    void unite(int a,int b)
    {
        a=getparent(a);
        b=getparent(b);
        if(Rank[a]<Rank[b])
        {
            swap(a,b);
        }
        if(Rank[a]==Rank[b])
        Rank[a]++;
        Parent[b]=a;
    }
};
int main()
{
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m;
cin>>n>>m;
DSU h(n+1);
while(m--)
{
    int a,b,c;
    cin>>a>>b>>c;
    if(a==1)
    {
        h.unite(b,c);
    }
    else
    {
        if(h.getparent(b)==h.getparent(c))
        cout<<"DA";
        else
        cout<<"NU";cout<<'\n';
    }
}
    return 0;
}