using System; using System.Diagnostics; using System.Collections.Generic; using System.Linq; using Enu = System.Linq.Enumerable; class Solution { int N, M, K; List[] G; int[] d; void calc() { rio(out N, out M, out K); G = new List[N + 1]; for (int i = 0; i <= N; i++) G[i] = new List(); for (int loop = 0; loop < M; loop++) { var r = ria(3); G[r[0]].Add(new edge(r[0], r[1], r[2])); G[r[1]].Add(new edge(r[1], r[0], r[2])); } d = ria(K); HashSet nowpos = new HashSet(); for (int i = 1; i <= N; i++) nowpos.Add(i); foreach (var cost in d) { HashSet nextpos = new HashSet(); foreach (var p in nowpos) { foreach (var np in G[p].Where(e => e.cost == cost).Select(e => e.to).Distinct()) { if (!nextpos.Contains(np)) nextpos.Add(np); } } nowpos = nextpos; } Console.WriteLine(nowpos.Count); Console.WriteLine(String.Join(" ", nowpos.OrderBy(e => e))); } [DebuggerDisplay("from : {from}, to : {to}, cost : {cost}")] private class edge { public int from, to; public int cost; public edge(int from, int to, int cost) { this.from = from; this.to = to; this.cost = cost; } } static void Main(string[] args) { new Solution().calc(); } #region static int ri() { return int.Parse(Console.ReadLine()); } static int[] ria(int n) { if (n <= 0) { Console.ReadLine(); return new int[0]; } else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray(); } static void rio(out int p1) { p1 = ri(); } static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; } static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static long rl() { return long.Parse(Console.ReadLine()); } static long[] rla(int n) { if (n <= 0) { Console.ReadLine(); return new long[0]; } else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray(); } static void rlo(out long p1) { p1 = rl(); } static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; } static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static double rd() { return double.Parse(Console.ReadLine()); } static double[] rda(int n) { if (n <= 0) { Console.ReadLine(); return new double[0]; } else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray(); } static void rdo(out double p1) { p1 = rd(); } static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; } static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; } static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; } static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; } static void swap(ref T x, ref T y) { T temp = x; x = y; y = temp; } static void wa1(T[] a) { Debug.WriteLine(string.Join(" ", a)); } static void wa2(T[][] a) { foreach (var row in a) { Debug.WriteLine(String.Join(" ", row)); } } [DebuggerDisplay("{x} , {y}")] class point { public int x, y; public point(int x, int y) { this.x = x; this.y = y; } } #endregion } static class Extention { public static T[][] ToJagArray(this T[,] a) { int n = a.GetLength(0), m = a.GetLength(1); var ret = new T[n][]; for (int i = 0; i < n; i++) { ret[i] = new T[m]; for (int j = 0; j < m; j++) { ret[i][j] = a[i, j]; } } return ret; } }