#include<bits/stdc++.h>
#define nl "\n"
#define fi first
#define se second
#define pi 3.14159
#define ll long long
#define odd(a)  (a&1)
#define even(a)  !(a&1)
#define Mod 1'000'000'007
#define INF 2'000'000'000
#define sz(x) int(x.size())
#define charToInt(s) (s - '0')
#define ull unsigned long long
#define number_line iota(all(vec) , 1)
#define all(s) s.begin(), s.end()
#define rall(v) v.rbegin() , v.rend()
#define fixed(n) fixed << setprecision(n)
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define to_decimal(bin) stoll(bin, nullptr, 2)
#define Ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define Floor(n, m) (((n) / (m)) - ((n) % (m) ? 0 : 1))
#define Upper(s) transform(all(s), s.begin(), ::toupper);
#define Lower(s) transform(all(s), s.begin(), ::tolower);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
//  ----- bits-------
#define pcnt(n) __builtin_popcount(n)
#define pcntll(n) __builtin_popcountll(n)
#define clz(n) __builtin_clz(n)    // <---100
#define clzll(n) __builtin_clzll(n)
#define ctz(n) __builtin_ctz(n)  // 0001---->
#define ctzll(n) __builtin_ctzll(n)

using namespace std;

template < typename T = int > istream& operator >> (istream &in, vector < T > & v){
    for(auto & x : v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > & v){
    for(const T & x : v) out << x << " ";
    return out;
}

void esraa()
{
    //freopen("shuffle.in", "r", stdin), freopen("shuffle.out", "w", stdout);
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
struct DSU{
    vector < int > per1 , per2 , sz1 , sz2 , rank1 , rank2;
    explicit DSU(int n){
        per1.resize(n + 1);
        per2.resize(n + 1);
        sz1.resize(n + 1);
        sz2.resize(n + 1);
        rank1.resize(n + 1);
        rank2.resize(n + 1);
        iota(all(per1) , 0);
        iota(all(per2) , 0);
        fill(all(sz1) , 1);
        fill(all(sz2) , 1);
    }
    int get1(int x){
        return (per1[x] == x ? x : per1[x] = get1(per1[x]));
    }
    int get2(int x){
        return (per2[x] == x ? x : per2[x] = get2(per2[x]));
    }
    void join1(int x , int y){
        x = get1(x) , y = get1(y);
        if(x == y) return;
        if(rank1[x] < rank1[y]) swap(x , y);
        per1[y] = x , sz1[x] += sz1[y];
        if(rank1[x] == rank1[y]) rank1[x]++;
    }
    void join2(int x , int y){
        x = get2(x) , y = get2(y);
        if(x == y) return;
        if(rank2[x] < rank2[y]) swap(x , y);
        per2[y] = x , sz2[x] += sz2[y];
        if(rank2[x] == rank2[y]) rank2[x]++;
    }
    bool same1(int x , int y){
        return get1(x) == get1(y);
    }
    bool same2(int x , int y){
        return get2(x) == get2(y);
    }
};
void solve(){
    int n , m , k;
    cin >> n >> m >> k;
    DSU dsu(n);
    for(int i = 0; i < m; i++){
        int u , v;
        cin >> u >> v;
        dsu.join1(u , v);
    }
    for(int i = 0; i < k; i++){
        int u , v;
        cin >> u >> v;
        dsu.join2(u , v);
    }
    map < pair < int , int > , int > mp;
    for(int i = 1; i <= n; i++){
        int x = dsu.get1(i) , y = dsu.get2(i);
        mp[{x , y}]++;
    }
    for(int i = 1; i <= n; i++){
        int x = dsu.get1(i) , y = dsu.get2(i);
        cout << mp[{x , y}] << " ";
    }

}
int main()
{
    esraa();
    int t = 1;
    //cin >> t;
    //cin.ignore();
    while(t--)
      solve();
    return 0;
}