# https://yukicoder.me/problems/no/3482

from collections import deque

MAX_INT = 10 ** 18

class UnionFind:
    """
    UnionFindの基本的な処理を実装したクラス
    """

    def __init__(self, size):
        self.root = [i for i in range(size)]
        self.size = [1] * size

    def get_root(self, v):
        if v == self.root[v]:
            return v
        else:
            old_root = self.root[v]
            new_root = self.get_root(old_root)
            self.root[v] = new_root
            return new_root

    def merge(self, u, v):
        root_u = self.get_root(u)
        root_v = self.get_root(v)
        if root_u == root_v:
            return False

        if self.size[root_u] >= self.size[root_v]:
            self.size[root_u] += self.size[root_v]
            self.root[root_v] = root_u
            self.root[v] = root_u
        else:
            self.size[root_v] += self.size[root_u]
            self.root[root_u] = root_v
            self.root[u] = root_v
        return True
    
def bfs(N, next_nodes):
    queue = deque()
    queue.append(0)
    dists = [MAX_INT] * N
    dists[0] = 0
    while len(queue) > 0:
        v = queue.popleft()

        for w in next_nodes[v]:
            if dists[w] == MAX_INT:
                dists[w] = dists[v] + 1
                queue.append(w)
    return dists[N- 1]


def solve_bfs_same(N, edges, uf):
    r = uf.get_root(0)
    next_nodes = [[] for _ in range(N)]
    for a, b, c in edges:
        if c == 1 and r == uf.get_root(a):
            next_nodes[a].append(b)
            next_nodes[b].append(a)
    
    return bfs(N, next_nodes)

def solve_bfs_diff(N, edges, uf, r1, r2):
    r1 = uf.get_root(0)
    r2 = uf.get_root(N - 1)
    next_nodes = [[] for _ in range(N)]
    for a, b, c in edges:
        ra = uf.get_root(a)
        rb =uf.get_root(b)
        if c == 1 and (r1 == ra or r2 == ra):
            next_nodes[a].append(b)
            next_nodes[b].append(a)
        elif c == 2 and ((ra, rb) == (r1, r2) or (a, b) == (r2, r1)):
            next_nodes[a].append(b)
            next_nodes[b].append(a)
    
    return bfs(N, next_nodes)




def solve(N, M, edges):

    uf = UnionFind(N)

    # C=1のタイプのものだけつかってUnionFind
    for a, b, c in edges:
        if c == 1:
            uf.merge(a, b)

    # 同じ連結成分にいればSameが証明できる最小値はBFSで解く
    if uf.get_root(0) == uf.get_root(N - 1):
        answer = ["Same", solve_bfs_same(N, edges, uf)]
        return answer

    # C=2のタイプを使って「隣接する」連結成分にいるかを確認
    r1 = uf.get_root(0)
    r2 = uf.get_root(N - 1)
    for a, b, c in edges:
        ra = uf.get_root(a)
        rb =uf.get_root(b)
        if (ra, rb) == (r1, r2) or (a, b) == (r2, r1):
            answer = ["Different", solve_bfs_diff(N, edges, uf, r1, r2)]
            return answer

    # いればBFSで解く
    return ["Unknown"]


def main():
    T = int(input())
    answers = []
    for _ in range(T):
        N, M = map(int, input().split())
        edges = []
        for _ in range(M):
            a, b, c = map(int, input().split())
            edges.append((a - 1, b - 1, c))
        
        ans =solve(N, M, edges)
        answers.append(ans)

    for ans in answers:
        for a in ans:
            print(a)




if __name__ == "__main__":
    main()