#include <iostream>
#include <fstream>

using namespace std;

int to[100002],rang[100002];

inline int find(int x)
{
    int R=x;
    while(to[R]!=R)
        R=to[R];
    while(to[x]!=x)
    {
        int y=to[x];
        to[x]=R;
        x=y;
    }
    return R;
}

inline void unite(int x, int y)
{
    if(rang[x]>rang[y])
        to[y]=x;
    else
        to[x]=y;
    if(rang[x]==rang[y])
        rang[y]++;
}

int main()
{
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    int n,q; f>>n>>q;
    for(int i=1;i<=n;i++)
    {
        to[i]=i;
        rang[i]=1;
    }

    while(q--)
    {
        int t,x,y; f>>t>>x>>y;
        if(t==1)
            unite(find(x),find(y));
        else
            g<<((find(x)==find(y)) ? "DA\n" : "NU\n");
    }
    f.close();
    g.close();
    return 0;
}