#include <bits/stdc++.h>
using namespace std;

int main() {
  int T;
  cin>>T;
  int INF;
  INF=INT_MAX;
  while(T--){
    int N,M;
    cin>>N>>M;
    vector<vector<int>> A(N+1);
    vector<pair<int,int>> B;
    for(int i=0;i<M;i++){
      int a,b,c;
      cin>>a>>b>>c;
      if(c==1){
        A[a].push_back(b);
        A[b].push_back(a);
      }
      else{
        B.push_back({a,b});
      }
    }
    vector<int> D(N+1,INF);
    queue<int> q;
    D[1]=0;
    q.push(1);
    while(!q.empty()){
      int v;
      v=q.front();
      q.pop();
      for(int x:A[v]){
        if(D[x]==INF){
          D[x]=D[v]+1;
          q.push(x);
        }
      }
    }
    vector<int> E(N+1,INF);
    while(!q.empty()){
      q.pop();
    }
    E[N]=0;
    q.push(N);
    while(!q.empty()){
      int v;
      v=q.front();
      q.pop();
      for(int x:A[v]){
        if(E[x]==INF){
          E[x]=E[v]+1;
          q.push(x);
        }
      }
    }
    if(D[N]!=INF){
      cout<<"Same"<<"\n"<<D[N]<<"\n";
      continue;
    }
    int a;
    a=INF;
    for(auto [x,v] : B){
      if(D[x]!=INF && E[v]!= INF){
        a=min(a,D[x]+1+E[v]);
      }
      if(D[v]!=INF && E[x]!=INF){
        a=min(a,D[v]+1+E[x]);
      }
    }
    if(a!=INF){
      cout<<"Different"<<"\n"<<a<<"\n";
    }
    else{
      cout<<"Unknown"<<"\n";
    }
  }
}