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

void solve(){
  int inf=1e9;
  int n,m;
  cin>>n>>m;
  vector<vector<int>> g(n);
  vector<pair<int,int>> vp;
  for (int i=0;i<m;i++){
    int a,b,c;
    cin>>a>>b>>c;
    a--;b--;
    if (c==1){
      g[a].push_back(b);
      g[b].push_back(a);
    }
    if (c==2) vp.push_back({a,b});
  }
  auto f=[&](int s){
    vector<int> dist(n,inf);
    queue<int> q;
    dist[s]=0;
    q.push(s);
    while (!q.empty()){
      int v=q.front();
      q.pop();
      for (int u:g[v]){
        if (dist[u]!=inf) continue;
        dist[u]=dist[v]+1;
        q.push(u);
      }
    }
    return dist;
  };
  auto d1=f(0),d2=f(n-1);
  if (d1[n-1]!=inf){
    cout<<"Same\n";
    cout<<d1[n-1]<<endl;
    return;
  }
  int ans=inf;
  for (auto [a,b]:vp){
    ans=min(ans,d1[a]+d2[b]+1);
    ans=min(ans,d2[a]+d1[b]+1);
  }
  if (ans!=inf){
    cout<<"Different\n";
    cout<<ans<<endl;
    return;
  }
  cout<<"Unknown\n";
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}