from sys import stdin
input = stdin.readline
from collections import deque

for _ in range(int(input())):
    N, M = map(int, input().split())
    G = [[] for _ in range(N)]
    for _ in range(M):
        u, v, c = map(int, input().split())
        u, v, c = u-1, v-1, c-1
        G[u].append((v, c))
        G[v].append((u, c))
    
    que = deque()
    que.append((0, 0))
    visited = [[-1]*2 for _ in range(N)]
    visited[0][0] = 0
    while que:
        n, d = que.popleft()
        for v, c in G[n]:
            if c == 1 and d == 1:
                continue
            if visited[v][c^d] == -1:
                visited[v][c^d] = visited[n][d]+1
                que.append((v, d^c))
    
    if visited[-1][0] != -1:
        print("Same")
        print(visited[-1][0])
    elif visited[-1][1] != -1:
        print("Different")
        print(visited[-1][1])
    else:
        print("Unknown")