#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
void solve() {
	int n, m; cin >> n >> m;
	vector to(n, vector<P>());
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c;
		a--, b--;
		to[a].emplace_back(b, c);
		to[b].emplace_back(a, c);
	}
	vector<int>d(n, INF);
	vector<int>e(n, -1);
	d[0] = 0;
	e[0] = 1;
	queue<int>q;
	q.emplace(0);
	while (!q.empty()) {
		auto v = q.front();
		q.pop();
		for (auto[nv, t] : to[v]) {
			if (chmin(d[nv], d[v] + 1)) {
				chmax(e[nv], t);
				q.push(nv);
			}
		}
	}
	if (d[n - 1] == INF) {
		cout << "Unknown" << endl;
	}
	else if (e[n - 1] == 1) {
		cout << "Same" << endl;
		cout << d[n - 1] << endl;
	}
	else {
		cout << "Different" << endl;
		cout << d[n - 1] << endl;
	}
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--)solve();
	return 0;
}