#include <fstream>
#define NMAX 100000

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, c, x, y;
int h[NMAX], tata[NMAX];
void Union(int x, int y)
{
    if (h[x]>h[y])
        tata[y]=x;
    else
    {
        if (h[x]==h[y]) h[y]++;
            tata[x]=y;
    }
}
int Find(int x)
{
    int rad=x, a, t;
    while (tata[rad])
        rad=tata[rad];
    a=x;
    while (a!=rad)
    {
        t=tata[a];
        tata[a]=rad;
        a=t;
    }
    return rad;
}

int main()
{
    int i;
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>c>>x>>y;
        if (c==1)
            Union(x, y);
        else if (Find(x)==Find(y))
            fout<<"DA"<<'\n';
        else fout<<"NU"<<'\n';
    }
    return 0;
}