import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul, add
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, M, K = MAP()
abc = [LIST() for _ in range(M)]
d = LIST()

graph = [[] for _ in range(N)]

for a, b, c in abc:
	graph[a-1].append((b-1, c))
	graph[b-1].append((a-1, c))

memo = [[0]*(K+1) for _ in range(N+1)]

def DFS(n, step):
	if memo[n][step]: return True
	if step == K:
		ans.add(n+1)
		return True

	ret = False
	for node, w in graph[n]:
		if step <= K-1 and w == d[step]:
			if DFS(node, step+1): ret = True
	memo[n][step] = ret
	return ret

ans = set()
for i in range(N):
	DFS(i, 0)

ans = list(ans)
print(len(ans))
print(*sorted(ans))