#include <bits/stdc++.h>

using namespace std;

using Graph = vector<vector<int>>;

void read_graph(Graph& G, int edge_count)
{
    for (int i = 0; i < edge_count; ++i)
    {
        int u, v;
        cin >> u >> v;
        --u, --v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
}

void dfs(int p, const Graph& G, vector<bool>& visited, vector<int>& comp)
{
    visited[p] = true;
    comp.push_back(p);
    for (int q : G[p])
    {
        if (!visited[q])
        {
            dfs(q, G, visited, comp);
        }
    }
}

vector<vector<int>> get_components(const Graph& G)
{
    vector<vector<int>> components;
    vector<int> comp;
    vector<bool> visited(G.size(), false);
    for (int i = 0; i < G.size(); ++i)
    {
        if (!visited[i])
        {
            comp.clear();
            dfs(i, G, visited, comp);
            components.push_back(comp);
        }
    }
    return components;
}

int main()
{
    int N, M, K;
    cin >> N >> M >> K;
    Graph Ga(N);
    Graph Gb(N);
    read_graph(Ga, M);
    read_graph(Gb, K);

    vector<vector<int>> components_a = get_components(Ga);
    vector<int> comp_a_id(N);
    for (int i = 0; i < components_a.size(); ++i)
    {
        for (int x: components_a[i])
        {
            comp_a_id[x] = i;
        }
    }

    vector<int> ans(N);
    vector<int> comp_a_cnt(components_a.size());

    for (vector<int> comp_b : get_components(Gb))
    {
        for (int x : comp_b)
        {
            comp_a_cnt[comp_a_id[x]] += 1;
        }
        for (int x : comp_b)
        {
            ans[x] = comp_a_cnt[comp_a_id[x]] - 1;
        }
        for (int x : comp_b)
        {
            comp_a_cnt[comp_a_id[x]] = 0;
        }
    }

    for (int x : ans)
    {
        cout << x << " ";
    }

    return 0;
}