#include <iostream>
#include <fstream>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int parent[100010],Rank[100010],n,m;

void makeSet(int x)
{
    parent[x]=x;
    Rank[x]=0;
}

int Find(int x)
{
    while(parent[x]!=x)
        parent[x]=Find(x);

    return parent[x];
}

void Union(int x,int y)
{
    int xroot=Find(x);
    int yroot=Find(y);

    if(xroot==yroot)
        return;

    if(Rank[x]<Rank[y])
    {
        parent[x]=yroot;
        return;
    }

    if(Rank[x]>Rank[y])
    {
        parent[y]=xroot;
        return;
    }

    if(Rank[x]==Rank[y])
    {
        parent[y]=xroot;
        Rank[x]++;
    }
}

int main()
{
    int val,x,y;
    f >> n >> m;
    for(int i=0;i<m;i++)
    {
        f>> val >> x >> y;
        if(val==1)
        {
            if(parent[x]==0)
                makeSet(x);
            if(parent[y]==0)
                makeSet(y);
            Union(x,y);

        }else {

            if(parent[x]==parent[y])
                g << "DA\n";

            else g << "NU\n";

        }

    }
    return 0;
}