#include using namespace std; using VS = vector; using LL = long long; using VI = vector; using VVI = vector; using PII = pair; using PLL = pair; using VL = vector; using VVL = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--) #define debug(x) cerr << #x << ": " << x << endl const int INF = 1e9; const LL LINF = 1e16; const LL MOD = 1000000007; const double PI = acos(-1.0); int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- 2018/04/19 Problem: yukicoder 092 / Link: http://yukicoder.me/problems/no/092 ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ LL N, M, K; LL ans = 0LL; templateusing VV = vector>; int main() { cin.tie(0); ios_base::sync_with_stdio(false); cin >> N >> M >> K; vector>G(N); FOR(i, 0, M) { int a, b, c; cin >> a >> b >> c; a--, b--; G[a].emplace_back(b, c); G[b].emplace_back(a, c); } VI d(K); FOR(i, 0, K) { cin >> d[i]; } VVdp(K + 1, VI(N, 0)); FOR(i, 0, N)dp[0][i] = 1; FOR(k, 0, K) { FOR(i, 0, N) { if (dp[k][i]) { FOR(j, 0, SZ(G[i])) { int c = G[i][j].second; int nv = G[i][j].first; if (c == d[k]) dp[k + 1][nv] = dp[k][i]; } } } } VI a; FOR(i, 0, N) { ans += dp[K][i]; if(dp[K][i])a.push_back(i+1); } cout << ans << "\n"; FOR(i, 0, SZ(a)) { cout << a[i] << " \n"[i == SZ(a) - 1]; } return 0; }