#include <bits/stdc++.h>
using namespace std;
vector<int> p;
vector<int> r;
vector<vector<int> > g, group;
vector<bool> vis;
int findl(int n)
{
    if(p[n] == 0) return n;
    return p[n] = findl(p[n]);
}
void unio(int a, int b)
{
    a = findl(a);
    b = findl(b);
    if(a != b)
    {
        if(r[a] < r[b]) swap(a, b);
        p[b] = a;
        if(r[a] == r[b]) r[a]++;
    }
}
void dfs(int n)
{
    vis[n] = 1;
    group[group.size() - 1].push_back(n);
    for(auto x : g[n])
    {
        if(!vis[x])
        {
            dfs(x);
        }
    }
}
int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    p.resize(n + 1);
    r.resize(n + 1, 1);
    g.resize(n + 1);
    vis.resize(n + 1);
    int x, y;
    for (int i = 0; i < m; i++)
    {
        cin >> x >> y;
        unio(x, y);
    }
    for (int i = 0; i < k; i++)
    {
        cin >> x >> y;
        if(findl(x) == findl(y))
        {
            g[x].push_back(y);
            g[y].push_back(x);
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if(!vis[i])
        {
            group.push_back({});
            dfs(i);
        }
    }
    vector<int> ans(n + 1);
    for(int i = 0; i < group.size(); i++)
    {
        for (auto j : group[i])
        {
            ans[j] = group[i].size() - 1;
        }
    }
    for(int i = 1; i <= n; i++) cout << ans[i] << " ";
    return 0;
}