#include <fstream>
#define dim 100005
#define for(i,a,b) for(int i=(a);i<=(b);++i)
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,t,c,x,y;
int parinte[dim+1];
int sef(int x)
{
    if(parinte[x]==x)
        return x;
    return sef(parinte[x]);
    parinte[x]=sef(parinte[x]);
}
void adauga(int x,int y)
{
    int sef1=sef(x);
    int sef2=sef(y);
    parinte[sef2]=sef1;
}
void verifica(int x,int y)
{
    if(sef(x)==sef(y))
        cout<<"DA\n";
    else cout<<"NU\n";
}
void solve()
{
    cin>>n>>t;
    for(i,1,n)
        parinte[i]=i;
    while(t--)
    {
        cin>>c>>x>>y;
        if(c==1)
            adauga(x,y);
        else if(c==2)
            verifica(x,y);
    }
}
int main()
{
    solve();
    return 0;
}