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



#define pp pair<int,int>
#define oo 100000000
#define RRR ios_base::sync_with_stdio(false);cin.tie(0);
#define ll long long
#define int ll
int parent[100000];
int ran[100000];
void makeset(int x)
{
    parent[x] = x;
    ran[x] = 0;
}

int findr(int p)
{

    if (parent[p] != p)
        parent[p] = findr(parent[p]);
    return parent[p];
}

void uni(int x,int y)
{
    int yroot = findr(y);
    int xroot = findr(x);
    if (yroot == xroot)
        return ;
    if (ran[xroot] < ran[yroot])
        parent[xroot] = yroot;
    else if (ran[xroot] > ran[yroot])
        parent[yroot] = xroot;
    else
    {
        parent[yroot] = xroot;
        ran[xroot]++;
    }
}

int32_t main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m;
    cin >> n >> m;
    for (int i=0;i<=n;i++)
        makeset(i);
    for (int i=0;i<m;i++)
    {
        int a,b,c;
        cin >> a >> b >> c;
        if (a == 1)
            uni(b,c);
        else
        {
            if (findr(b) == findr(c))
                cout << "DA\n";
            else cout << "NU\n";

        }
    }

    return 0;
}