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)
    visited = [-1]*N
    dist = [-1]*N
    visited[0] = 0
    dist[0] = 0
    while que:
        n = que.popleft()
        for v, c in G[n]:
            if visited[v] == -1:
                visited[v] = visited[n]+1
                dist[v] = dist[n]^c
                que.append(v)
    
    if dist[-1] == 0:
        print("Same")
        print(visited[-1])
    elif dist[-1] == 1:
        print("Different")
        print(visited[-1])
    else:
        print("Unknown")