#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
struct UnionFind{
    int cnt;
    vector<int> par, siz;
    UnionFind(int N) : par(N), siz(N,1){
        rep(i,N) par[i] = i;
        cnt = N;
    }
    int root(int x){
        if(par[x]==x) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x,int y){
        x = root(x); y = root(y);
        if(x==y) return false;
        --cnt;
        if(siz[x]<siz[y]) swap(x,y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x){
        return siz[root(x)];
    }
    bool same(int x,int y){
        return root(x) == root(y);
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        int n,m;
        cin >> n >> m;
        vector<vector<int>> g(n);
        UnionFind uf(n);
        vector<pair<int,int>> a;
        rep(i,m){
            int u,v,c;
            cin >> u >> v >> c;
            --u, --v;
            if(c==1){
                uf.unite(u,v);
                g[u].emplace_back(v);
                g[v].emplace_back(u);
            }else a.emplace_back(u,v);
        }
        if(uf.same(0,n-1)){
            vector<int> dist(n,INF);
            dist[0] = 0;
            queue<int> que;
            que.emplace(0);
            while(que.size()){
                int now = que.front();
                que.pop();
                for(int x:g[now]){
                    if(chmin(dist[x],dist[now]+1)){
                        que.emplace(x);
                    }
                }
            }
            cout << "Same\n" << dist[n-1] << '\n';
        }else{
            for(auto [u,v]:a){
                g[u].emplace_back(v);
                g[v].emplace_back(u);
                uf.unite(u,v);
            }
            if(uf.same(0,n-1)){
                vector<int> dist(n,INF);
                dist[0] = 0;
                queue<int> que;
                que.emplace(0);
                while(que.size()){
                    int now = que.front();
                    que.pop();
                    for(int x:g[now]){
                        if(chmin(dist[x],dist[now]+1)){
                            que.emplace(x);
                        }
                    }
                }
                cout << "Different\n" << dist[n-1] << '\n';
            }else{
                cout << "Unknown\n";
            }
        }
    }
    return 0;
}