#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int maxn=100001;
int TT[maxn],RG[maxn];
int N,M;
int find(int x)
{
    int R, y;
    for (R = x; TT[R] != R; R = TT[R]);

    while(TT[x]!=x)
    {
        y = TT[x];
        TT[x] = R;
        x = y;
    }
    return R;
}
void unite(int x, int y)
{
    if (RG[x] > RG[y])
        TT[y] = x;
            else TT[x] = y;

    if (RG[x] == RG[y]) RG[y]++;
}
int main()
{
    int cod,x,y;
    f>>N>>M;
    for (int i=1;i<=N;i++)
        {RG[i]=1;TT[i]=i;}
    for (int i=1;i<=M;i++)
    {
        for(int i=1;i<=N;i++)
        f>>cod>>x>>y;
        if (cod==1)
            if (find(x) != find(y))
                unite(find(x), find(y));
        if (cod==2)
            {if (find(x)==find(y)) g<<"DA"<<'\n';
            else g<<"NU"<<'\n';}
    }

}