#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
#define cin fin
#define cout fout
int t[100001],n,op,x,y;
void Union(int x,int y)
{
    t[x]=y;
}
int Find(int x)
{
    int rad=x,y;
    while(t[rad]!=0)
        rad=t[rad];
    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x =y;
    }
    return rad;
}
int main()
{
    cin >> n >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> op >> x >> y;
        x = Find(x);
        y = Find(y);
        if (op==1 && x!=y)
            Union(x,y);
        else
        {
            if (x!=y)
                cout << "NU\n";
            else
                cout << "DA\n";
        }
    }
    return 0;
}