#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define nleft (n<<1)
#define nright (nleft+1)

#include<vector>

using namespace std;
#include<fstream>
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

#define DISJOINT_MAX 66666
#define NMAX 66666

const int INF = 0x3f3f3f3f;
const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

int n,m,i,j,t;

class Disjoint{
	public:
	int Root[DISJOINT_MAX];
	int Rang[DISJOINT_MAX];
	int n;
	
	int init(int a)
	{
		n=a;
		FWD(i,1,n+1)
	    {
	        Root[i]=i;
	        Rang[i]=1;
	    }
	}
	
	int find(int x)
	{
		int r, aux;
		for(r=x; Root[r]!=r; r=Root[r]);
		
		while(Root[x]!=x) // Euristic I
		{
			aux=Root[x];
			Root[x]=r;
			x=aux;
		}
		
		return r;
	}
	
	void unite(int x, int y)
	{
		if(Rang[x] > Rang[y]) // Euristic II
			Root[y]=x;
		else
			Root[x]=y;
		if(Rang[x]==Rang[y]) Rang[y]++;
	}
	
};

Disjoint A;

int main()
{
	cin>>n>>t;
	A.init(n);
     
    while(t--)
    {
        int c,x,y;
        cin>>c>>x>>y;
         
        if(c==1){
            A.unite(A.find(x), A.find(y));
        }
        else
            if(A.find(x)==A.find(y))
                cout<<"DA \n";
            else
                cout<<"NU \n";
    }
    return 0;

	return 0;
}