#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<int, ll> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b), sizeof(a))
#define SZ(i) int(i.size())
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define REP1(i,j) FOR(i, 1, j+1, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define ALL(_a) _a.begin(),_a.end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define X first
#define Y second
#ifdef tmd
#define TIME(i) Timer i(#i)
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<" ,";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,deque<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define TIME(i)
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
#endif
class Timer {
private:
    string scope_name;
    chrono::high_resolution_clock::time_point start_time;
public:
    Timer (string name) : scope_name(name) {
        start_time = chrono::high_resolution_clock::now();
    }
    ~Timer () {
        auto stop_time = chrono::high_resolution_clock::now();
        auto length = chrono::duration_cast<chrono::microseconds>(stop_time - start_time).count();
        double mlength = double(length) * 0.001;
        debug(scope_name, mlength);
    }
};

const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int iNF = 0x3f3f3f3f;
const ll MAXN = 200005;

int n, k, l;

int djs1[MAXN], djs2[MAXN];
int fnd(int *djs, int x) {
    return djs[x] == x ? x : djs[x] = fnd(djs, djs[x]);
}

void mrg(int *djs, int x, int y) {
    x = fnd(djs, x), y = fnd(djs, y);
    djs[x] = y;
}

/********** Good Luck :) **********/
int main()
{
    TIME(main);
    IOS();

    cin >> n >> k >> l;

    REP1 (i, n) {
        djs1[i] = djs2[i] = i;
    }

    REP (i, k) {
        int u, v;
        cin >> u >> v;
        mrg(djs1, u, v);
    }
    
    REP (i, l) {
        int u, v;
        cin >> u >> v;
        mrg(djs2, u, v);
    }

    vector<pair<int, pii>> lst;
    vector<int> ans(n + 1);
    REP1 (i, n) {
        lst.eb(i, pii(fnd(djs1, i), fnd(djs2, i)));
    }
    sort(ALL(lst), [&](pair<int, pii> p1, pair<int, pii> p2) {
        return p1.Y < p2.Y;
    });
    debug(lst);
    int len = 0;
    REP (i, n + 1) {
        if (i == n || (i && lst[i].Y != lst[i-1].Y)) {
            for (int j=i-len; j<i; j++) {
                ans[lst[j].X] = len;
            }
            len = 0;
        }
        len++;
    }

    REP1 (i, n) {
        cout << ans[i] << " \n"[i==n];
    }
    return 0;
}


Measured memory_bytes: 6772