#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

using i128 = __int128;
using u128 = unsigned __int128;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m, k;
    std::cin >> n >> m >> k;
    
    std::vector<bool> f(n);
    for (int i = 0; i < k; i++) {
        int x;
        std::cin >> x;
        x--;
        f[x] = true;
    }
    
    std::vector<std::vector<int>> adj(n);
    
    for (int i = 0; i < m; i++) {
        int a, b;
        std::cin >> a >> b;
        a--;
        b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    
    std::vector dis(n, std::array<std::array<int, 2>, 2> {-1, -1, -1, -1});
    std::priority_queue<std::array<int, 3>, std::vector<std::array<int, 3>>, std::greater<>> pq;
    for (int i = 0; i < n; i++) {
        if (f[i]) {
            pq.push({0, i, i});
        }
    }
    
    while (!pq.empty()) {
        auto [d, x, s] = pq.top();
        pq.pop();
        
        if (dis[x][1][0] != -1) {
            continue;
        }
        if (s == dis[x][0][1]) {
            continue;
        }
        if (dis[x][0][0] == -1) {
            dis[x][0] = {d, s};
        } else {
            dis[x][1] = {d, s};
        }
        
        for (auto y : adj[x]) {
            pq.push({d + 1, y, s});
        }
    }
    
    for (int i = 0; i < n; i++) {
        std::cout << dis[i][f[i]][0] << " \n"[i == n - 1];
    }
    
    return 0;
}