#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ll long long
#define sz size()

using namespace std;
/*const long long mod = 998244353;
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
long long v[200005];*/
//long long
int nr[100005],t[100005];
const int inf=1<<30;
int radacina(int x)
{
    if(!t[x])
       return x;
    t[x]=radacina(t[x]);
    return t[x];
}
int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        nr[i]=1;
    while(q--)
    {
        int tip,x,y;
        cin>>tip>>x>>y;
        int rx=radacina(x);
        int ry=radacina(y);
        if(tip==1)
        {
            if(rx==ry)
               continue;
            if(nr[rx]<nr[ry])
               t[rx]=ry,nr[ry]+=nr[rx];
            else if(nr[rx]>=nr[ry])
                  t[ry]=rx,nr[rx]+=nr[ry];
        }
        else
        {
            if(rx==ry)
               cout<<"DA\n";
            else
                cout<<"NU\n";
        }
    }
    return 0;
}