#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int NMAX=10005;
int Tata[NMAX];
int n,m;
inline int Find(int x)
{
    if(Tata[x]!=x)
        Tata[x]=Find(Tata[x]);
    return Tata[x];
}
inline void Union(int x,int y)
{
    Tata[x]=y;
}
int main()
{
    int x,y,op;
    f>>n>>m;
    for(int i=1;i<=n;i++)
        Tata[i]=i;
    for(int i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        int x1=Find(x);
        int y1=Find(y);
        if(op==1)
            Union(x1,y1);
        else
        {
            if(x1==y1)
                g<<"DA\n";
            else
                g<<"NU\n";
        }
    }
    return 0;
}