//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

vector<ll> dist(ll st, vector<vector<ll>>& arr, vector<bool>& stop, ll start_cost, ll stop_cost) {
	vector<ll> d(arr.size(), INF64);
	d[st] = start_cost;
	priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
	pq.emplace(d[st], st);
	while (!pq.empty()) {
		auto[nd, v] = pq.top();
		pq.pop();
		if (d[v] != nd) {
			continue;
		}
		for (auto i : arr[v]) {
			if (assign_min(d[i], nd + 1 + stop[i] * stop_cost)) {
				pq.emplace(d[i], i);
			}
		}
	}
	return d;
}

void solve() {
	ll n, m, k;
	cin >> n >> m >> k;
	vector<vector<ll>> arr(n);
	for (ll i = 0; i < m; i++) {
		ll a, b;
		cin >> a >> b;
		a--;
		b--;
		arr[a].push_back(b);
		arr[b].push_back(a);
	}
	string s;
	cin >> s;
	vector<ll> pos(k);
	for (ll i = 0; i < k; i++) {
		cin >> pos[i];
		pos[i]--;
	}
	vector<bool> stop(n, false), stop2(n, false);
	for (ll i = 0; i < n; i++) {
		stop[i] = s[i] == '1';
	}
	for (ll i = 0; i < n; i++) {
		if (!stop[i]) {
			continue;
		}
		for (auto j : arr[i]) {
			if (stop[j]) {
				stop2[i] = true;
				break;
			}
		}
	}
	vector<ll> ans = dist(pos[0], arr, stop, 0, INF32);
	for (auto i : ans) {
		cout << i << '\n';
	}
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}