#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long mod=998244353;
const long long mod2=469762049;
void solve(){
    int N,M;cin>>N>>M;
    int A[M+1],B[M+1],C[M+1];
    vector<int>G[N+1];
    for(int i=1;i<=M;i++){
        cin>>A[i]>>B[i]>>C[i];
        if(C[i]==1){
            G[A[i]].push_back(B[i]);
            G[B[i]].push_back(A[i]);
        }
    }
    queue<int>que;
    int dist[N+1];
    bool already[N+1];
    for(int i=1;i<=N;i++){
        dist[i]=1e9;
        already[i]=false;
    }
    dist[1]=0;
    que.push(1);
    while(!que.empty()){
        int pos=que.front();
        que.pop();
        if(already[pos]) continue;
        already[pos]=true;
        for(auto nex:G[pos]){
            if(already[nex]) continue;
            if(dist[nex]>dist[pos]+1){
                dist[nex]=dist[pos]+1;
                que.push(nex);
            }
        }
    }
    if(dist[N]!=1e9){
        cout<<"Same"<<endl;
        cout<<dist[N]<<endl;
        return;
    }
    int dist2[N+1];
    for(int i=1;i<=N;i++){
        dist2[i]=1e9;
        already[i]=false;
    }
    dist2[N]=0;
    que.push(N);
    while(!que.empty()){
        int pos=que.front();
        que.pop();
        if(already[pos]) continue;
        already[pos]=true;
        for(auto nex:G[pos]){
            if(already[nex]) continue;
            if(dist2[nex]>dist2[pos]+1){
                dist2[nex]=dist2[pos]+1;
                que.push(nex);
            }
        }
    }
    int ans=1e9;
    for(int i=1;i<=M;i++){
        chmin(ans,dist[A[i]]+dist2[B[i]]+1);
        chmin(ans,dist[B[i]]+dist2[A[i]]+1);
    }
    if(ans==1e9){
        cout<<"Unknown"<<endl;
        return;
    }
    cout<<"Different"<<endl;
    cout<<ans<<endl;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int T;cin>>T;
    while(T--) solve();
}