#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int a[100005],n,m,i,c,x,y;

int find(int x)
{
    int t=x,aux;
    while (a[x]!=x) x=a[x];
    while (t!=x)
    {
        aux=a[t];
        a[t]=x;
        t=aux;
    }
    return x;
}

void uneste(int x, int y)
{
    a[x]=y;
}

int main()
{
    f >> n >> m;
    for (i=1; i<=n; i++)
        a[i]=i;
    for (i=0; i<m; i++)
    {
        f >> c >> x >> y;
        if (c==2)
        {
            if (find(x)==find(y)) g << "DA\n";
            else g << "NU\n";
        }
        else
            uneste(find(x),find(y));
    }
}