#include<bits/stdc++.h>

using namespace std;

int n, m, k;

class pont{
public:
    vector<int> hova1;
    vector<int> hova2;
    int comp1 = -1;
    int comp2 = -1;
    void dfs1(int mi);
    void dfs2(int mi);
};

vector<pont> p;

void pont::dfs1(int mi){
    if(comp1 == -1){
        comp1 = mi;
        for (int i : hova1){
            p[i].dfs1(mi);
        }
    }
}

void pont::dfs2(int mi){
    if(comp2 == -1){
        comp2 = mi;
        for (int i : hova2){
            p[i].dfs2(mi);
        }
    }
}

int main(){
    //freopen("in.in", "r", stdin);
    cin >> n >> m >> k;
    p.resize(n);
    int a, b;
    for(int i=0;i<m;i++){
        cin >> a >> b;
        --a; --b;
        p[a].hova1.push_back(b);
        p[b].hova1.push_back(a);
    }
    for(int i=0;i<k;i++){
        cin >> a >> b;
        --a; --b;
        p[a].hova2.push_back(b);
        p[b].hova2.push_back(a);
    }
    for(int i=0;i<n;i++){
        p[i].dfs1(i);
        p[i].dfs2(i);
    }
    map<pair<int,int>, int> m;
    for(pont& pp : p){
        ++m[{pp.comp1, pp.comp2}];
    }
    for(pont& pp : p){
        cout << m[{pp.comp1, pp.comp2}]-1 << ' ';
    }

return 0;
}