#include <bits/stdc++.h>
#define fir first
#define sec second
#define int long long
#define el '\n'
#define all(x) (x).begin(), (x).end()
#define FINISH cout << "FINISH" << endl;
#define debug(x) cout << #x << " :== " << x << endl;
#define debugv(x)\
    cout << #x << " :: ";\
    for (auto v : x) cout << v << " ";\
    cout << endl;

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;

const int mod = 998244353;
const int inf = 0x3f3f3f3f;

struct Data {
	long long p;
	int idx, rnk;
};

long long getp(int n)
{
	vector<ll> inp(n + 1, 0);

	for (int i = 1; i < n; i++) {
		int x, y;
		cin >> x >> y;
		inp[x]++, inp[y]++;
	}

	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += inp[i] * inp[i];
	}
	// cout << ans << el;
	return ans;
}

void solve() 
{
    int n, k;
    cin >> n >> k;
    vector<Data> v(k * 2 + 1); 
    for (int i = 1; i <= k * 2; i++) {
    	long long p = getp(n);
    	v[i].idx = i;
    	v[i].p = p;

    	// cout << p << endl;
    }
    sort(next(v.begin()), v.end(), [&] (Data x, Data y) {
    	return x.p < y.p;
    });
    for (int i = 1; i <= k * 2; i++) {
    	v[i].rnk = i;
    }
    sort(next(v.begin()), v.end(), [&] (Data x, Data y) {
    	return x.idx < y.idx;
    });
    for (int i = 1; i <= k * 2; i++) {
    	if (v[i].rnk > k) {
    		cout << "DSU" << el;
    	}
    	else {
    		cout << "Uniform" << el;
    	}
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}