#include <bits/stdc++.h>
using namespace std;
int n,m;
int t[100005],a[100005];
int Find(int x)
{
    int rad=x,y;
    while (t[rad]!=0)
    {
        rad=t[rad];
    }
    while (x!=0)
    {
        y=t[x];
        t[x]=rad;
        x=y;
    }
    return rad;
}
inline void Union(int x,int y)
{
    t[y]=x;
}
int main()
{int i,cod,x,y;
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    in>>n>>m;
    for (i=1;i<=m;i++)
    {
        in>>cod>>x>>y;
        if (cod==1)
        {
            Union(Find(x),Find(y));
        }
        else
        {
            if (Find(x) == Find (y))
                out<<"DA\n";
            else
                out<<"NU\n";
        }
    }
    out.close();
    in.close();
    return 0;
}