#include <bits/stdc++.h>
using namespace std;
int main(void){
    const int INF=10000000;
    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,int>>vis(n,{INF,-1});
        vector<pair<int,int>>vis2(n,{INF,-1});
        vis[0]={0,0};
        vis2[0]={0,0};
        queue<pair<int,int>>q;
        q.push({0,0});
        q.push({0,1});
        while(!q.empty()){
            int now=q.front().first,op=q.front().second;
            q.pop();
            if(op==0){
                for(int i=0;i<v[now].size();i++){
                    if(vis[v[now][i].first].first==INF){
                        if(v[now][i].second==0){
                            vis2[v[now][i].first]={vis[now].first+1,!(vis[now].second^v[now][i].second)};
                            q.push({v[now][i].first,1});
                        }else{
                            vis[v[now][i].first]={vis[now].first+1,!(vis[now].second^v[now][i].second)};
                            vis2[v[now][i].first]={vis[now].first+1,!(vis[now].second^v[now][i].second)};
                            q.push({v[now][i].first,0});
                            q.push({v[now][i].first,1});
                        }
                    }
                }
            }else{
                for(int i=0;i<v[now].size();i++){
                    if(vis2[v[now][i].first].first==INF&&v[now][i].second==1){
                        vis2[v[now][i].first]={vis2[now].first+1,!(vis2[now].second^v[now][i].second)};
                        q.push({v[now][i].first,1});
                    }
                }
            }
        }
        if(vis2[n-1].second==-1){
            cout<<"Unknown"<<endl;
        }else{
            cout<<(vis2[n-1].second?"Different":"Same")<<endl<<vis2[n-1].first<<endl;
        }
    }
    return 0;
}