#include <fstream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <stack>
#include <iomanip>
#include <queue>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

#define nmax 100010
int p[nmax],n,m,i;

int Find(int x)
{
    int rad=x;
    while (rad!=p[rad])
        rad=p[rad];
    while (x!=p[x])
    {
        int aux=x;
        x=p[x];
        p[aux]=rad;
    }
    return rad;
}

void Union(int x, int y)
{
    p[x]=y;
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=n; i++)
        p[i]=i;
    for (i=1; i<=m; i++)
    {
        int op,x,y;
        fin >> op >> x >> y;
        x=Find(x);
        y=Find(y);
        if (op==2)
            fout << ( x==y ? "DA\n" : "NU\n");
        else
            Union(x,y);
    }
}