#include <bits/stdc++.h>

using namespace std;

int t[100005];

inline int Find(int x)
{
    int rad=x,y;
    while(t[rad]>0)
        rad=t[rad];
    while(t[x]>0)
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return rad;
}

inline void Union(int x,int y)
{
    t[x]+=t[y];
    t[y]=x;
}

inline void Citire()
{
    int i,x,y,z,n,r1,r2,m;
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=-1;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        r1=Find(y);
        r2=Find(z);
        if(x==1)
            Union(r1,r2);
        if(x==2)
                {
                    if(r1==r2) fout<<"DA"<<"\n";
                        else fout<<"NU"<<"\n";
                }
    }
    fin.close();
    fout.close();
}

int main()
{
    Citire();
    return 0;
}