using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new List<string>();
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            var (n, m) = (c[0], c[1]);
            var map = NArr(m);
            var (res, num) = Quod(n, m, map);
            ans.Add(res);
            if (res != "Unknown") ans.Add(num.ToString());
        }
        WriteLine(string.Join("\n", ans));
    }
    static (string ans, int num) Quod(int n, int m, int[][] map)
    {
        var tree = new List<(int to, int kind)>[n + 1];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, int kind)>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add((edge[1], edge[2]));
            tree[edge[1]].Add((edge[0], edge[2]));
        }
        var INF = int.MaxValue / 2;
        var len = new int[n + 1];
        for (var i = 2; i < len.Length; ++i) len[i] = INF;
        var len2 = new int[n + 1];
        for (var i = 0; i < len2.Length; ++i) len2[i] = INF;
        var q = new Queue<(int id, int kind)>();
        q.Enqueue((1, 1));
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            foreach (var next in tree[cur.id])
            {
                if (next.kind == 1)
                {
                    if (cur.kind == 1)
                    {
                        if (len[next.to] <= len[cur.id] + 1) continue;
                        len[next.to] = len[cur.id] + 1;
                        q.Enqueue((next.to, 1));
                    }
                    else
                    {
                        if (len2[next.to] <= len2[cur.id] + 1) continue;
                        len2[next.to] = len2[cur.id] + 1;
                        q.Enqueue((next.to, 2));
                    }
                }
                else if (cur.kind == 1)
                {
                    if (len2[next.to] <= len[cur.id] + 1) continue;
                    len2[next.to] = len[cur.id] + 1;
                    q.Enqueue((next.to, 2));
                }
            }
        }
        if (len[n] < INF) return ("Same", len[n]);
        return (len2[n] == INF ? "Unknown" : "Different", len2[n]);
    }
}