#include <bits/stdc++.h>
using namespace std;
#define pb push_back

void dfs(int v, const vector<vector<int> > &g, vector<int> &c, int comp){
    c[v] = comp;
    for (int x : g[v]){
        if (!c[x]){
            dfs(x, g, c, comp);
        }
    }
}

int main()
{
    int n, m, k, a, b;
    cin >> n >> m >> k;
    vector<vector<int> > ga(n+1);
    vector<vector<int> > gb(n+1);
    while (m--){
        cin >> a >> b;
        ga[a].pb(b);
        ga[b].pb(a);
    }
    while (k--){
        cin >> a >> b;
        gb[a].pb(b);
        gb[b].pb(a);
    }
    vector<int> ca(n+1, 0);
    int cnt = 1;
    for (int i=1; i<n+1; i++){
        if (!ca[i]){
            dfs(i, ga, ca, cnt);
            cnt++;
        }
    }
    vector<int> cb(n+1, 0);
    cnt = 1;
    for (int i=1; i<n+1; i++){
        if (!cb[i]){
            dfs(i, gb, cb, cnt);
            cnt++;
        }
    }
    map<pair<int, int>, int> ma;
    for (int i=1; i<n+1; i++){
        ma[{ca[i], cb[i]}]++;
    }
    for (int i=1; i<n+1; i++){
        cout << ma[{ca[i], cb[i]}] - 1 << " ";
    }
    return 0;
}