#include <bits/stdc++.h>
using namespace std;

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

vector <int> v;

void init(int n)
{
    for(int i=1; i<=n; i++)
        v[i] = -1;
}

int det(int x)
{
    if(v[x] < 0)
        return x;
    else
    {
        v[x] = det(v[x]);
        return v[x];
    }
}

void uneste(int t1, int t2)
{
    if(v[t1] <= v[t2])
    {
        v[t1] += v[t2];
        v[t2] = t1;
    }
    else
    {
        v[t2] += v[t1];
        v[t1] = t2;
    }
}

int main()
{
    int n, m, cerinta, x, y;
    fin>>n>>m;
    v.resize(n+1);
    init(n);
    while(m)
    {
        fin>>cerinta>>x>>y;
        if(cerinta == 1)
        {
            int t1=det(x);
            int t2=det(y);
            uneste(t1, t2);
        }
        else
        {
            int t1=det(x);
            int t2=det(y);
            if(t1 == t2) fout<<"DA\n";
            else fout<<"NU\n";
        }
        m--;
    }
    return 0;
}