#include <bits/stdc++.h>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,op,x,y,p[100005];
void init(int n)
{
    for(int i=1;i<=n;i++) p[i]=i;
}
int Find(int n)
{
    int r=n;
    while(r!=p[r]) r=p[r];

    while(p[n]!=r)
    {
        int t=p[n];
        p[n]=r;
        n=t;
    }
    return r;
}
void Union(int x,int y)
{
    int rx=Find(x);
    int ry=Find(y);
    if(rx!=ry) p[rx]=ry;
}
int main()
{
    in>>n>>m;
    init(n);
    while(m--)
    {
        in>>op>>x>>y;
        if(op==1) Union(x,y);
        else if(Find(x)==Find(y)) out<<"DA\n";
        else out<<"NU\n";
    }
    return 0;
}