import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N = readInt;
        const M = readInt;
        auto A = new int[M];
        auto B = new int[M];
        auto C = new int[M];
        foreach (i; 0 .. M) {
          A[i] = readInt - 1;
          B[i] = readInt - 1;
          C[i] = readInt;
        }
        
        auto graph = new int[][N];
        foreach (i; 0 .. M) if (C[i] == 1) {
          graph[A[i]] ~= B[i];
          graph[B[i]] ~= A[i];
        }
        
        auto dist = new int[][](2, N);
        foreach (h; 0 .. 2) {
          const src = (h == 0) ? 0 : (N-1);
          DList!int que;
          dist[h][] = -1;
          dist[h][src] = 0;
          que ~= src;
          for (; !que.empty; ) {
            const u = que.front;
            que.removeFront;
            foreach (v; graph[u]) {
              if (!~dist[h][v]) {
                dist[h][v] = dist[h][u] + 1;
                que ~= v;
              }
            }
          }
          debug writeln(dist[h]);
        }
        
        if (~dist[1][0]) {
          writeln("Same");
          writeln(dist[1][0]);
        } else {
          int ans = int.max;
          void check(int u, int v) {
            if (~dist[0][u] && ~dist[1][v]) {
              chmin(ans, dist[0][u] + 1 + dist[1][v]);
            }
          }
          foreach (i; 0 .. M) if (C[i] == 2) {
            check(A[i], B[i]);
            check(B[i], A[i]);
          }
          if (ans < int.max) {
            writeln("Different");
            writeln(ans);
          } else {
            writeln("Unknown");
          }
        }
      }
    }
  } catch (EOFException e) {
  }
}