#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> a,b,c;
	a.resize(m);
	b.resize(m);
	c.resize(m);
	for (int i = 0; i < m; i++){
		cin >> a[i] >> b[i] >> c[i];
	}

	vector<int> waru;
	waru.resize(k);
	vector<int> kouho;
	for (int i = 0; i < k; i++){
		cin >> waru[i];
	}
	
	for (int i = 0; i < m; i++){
		if (c[i] == waru[0]){
			kouho.push_back(a[i]);
			kouho.push_back(b[i]);
		}
	}
	for(int j=1;j<k;j++){
		for (int i = 0; i < m; i++){
			if (c[i] == waru[j]){
				for (int h = 0; h < kouho.size(); h++){
					if (kouho[h] == a[i]){
						kouho.erase(kouho.begin() + h);
						kouho.push_back(b[i]);
					}
					else if (kouho[h] == b[i]){
						kouho.erase(kouho.begin() + h);
						kouho.push_back(a[i]);
					}
				}
			}
		}
		sort(kouho.begin(), kouho.end());
		unique(kouho.begin(), kouho.end());
	}

	for (int i = 0; i < kouho.size(); i++){
		cout << kouho[i] << endl;
	}
	return 0;
}