#include <bits/stdc++.h>
using namespace std;
int main(void){
    int t;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        vector<pair<int,int>>v[n];
        for(int i=0;i<m;i++){
            int a,b,c;
            cin>>a>>b>>c;
            v[a-1].push_back({b-1,2-c});
            v[b-1].push_back({a-1,2-c});
        }
        vector<pair<int,pair<int,int>>>vis(n,{-1,{-1,0}});
        vis[0]={0,{0,0}};
        queue<int>q;
        q.push(0);
        while(!q.empty()){
            int now=q.front();
            q.pop();
            for(int i=0;i<v[now].size();i++){
                if(vis[v[now][i].first].first==-1&&(!(v[now][i].second==0&&vis[now].second.second==1))){
                    vis[v[now][i].first]={vis[now].first+1,{!(vis[now].second.first^v[now][i].second),!v[now][i].second}};
                    q.push(v[now][i].first);
                }
            }
        }
        if(vis[n-1].first==-1){
            cout<<"Unknown"<<endl;
        }else{
            cout<<(vis[n-1].second.first?"Different":"Same")<<endl<<vis[n-1].first<<endl;
        }
    }
    return 0;
}