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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

class Union_Find{
  private:
    vll par;// parent
    vll rank;// depth
    vll g_size;// group size
    vll e_num;// # of edges for each group
    ll c_num;// # of group

  public:
    Union_Find(ll N){
      par.resize(N);
      rank.resize(N);
      g_size.resize(N);
      e_num.resize(N);
      for(ll i=0; i<N; ++i){
        par[i] = i;
        rank[i] = 0;
        g_size[i] = 1;
        e_num[i] = 0;
      }
      c_num = N;
      return;
    };

    ~Union_Find(void){
      return;
    };

    //search the root
    ll find(ll x){
      if(par[x] == x){
        return x;
      }else{
        return par[x] = find(par[x]);
      }
    };

    ll group_size(ll x){
      return g_size[find(x)];
    };

    ll edge_num(ll x){
      return e_num[find(x)];
    };

    ll cluster_num(void){
      return c_num;
    };

    //merge the sets x or y belong
    void unite(ll x, ll y){
      x = find(x);
      y = find(y);
      if(x == y){
        e_num[x]++;
        return;
      }

      if(rank[x] < rank[y]){
        par[x] = y;
        g_size[y] += g_size[x];
        g_size[x] = 0;
        e_num[y] += e_num[x]+1;
        e_num[x] = 0;
      }else{
        par[y] = x;
        if(rank[x] == rank[y]){
          rank[x]++;
        }
        g_size[x] += g_size[y];
        g_size[y] = 0;
        e_num[x] += e_num[y]+1;
        e_num[y] = 0;
      }
      c_num--;
      return;
    };

    //judge x and y belong the same set or not
    bool same(ll x, ll y){
      return find(x) == find(y);
    };
};



int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, K, L;
  IN(N,K,L);
  Union_Find que1(N);
  Union_Find que2(N);
  REP(i,K){
    ll a, b;
    IN(a,b);
    que1.unite(a-1, b-1);
  }

  ll count1 = 0;
  unordered_map<ll, ll> mp1;
  REP(i,N){
    ll index = que1.find(i);
    if(mp1.find(index)==mp1.end()){
      mp1[index] = count1;
      count1++;
    }
  }

  REP(i,L){
    ll a, b;
    IN(a,b);
    que2.unite(a-1, b-1);
  }

  ll count2 = 0;
  unordered_map<ll, ll> mp2;
  REP(i,N){
    ll index = que2.find(i);
    if(mp2.find(index)==mp2.end()){
      mp2[index] = count2;
      count2++;
    }
  }

  map<pll, ll> hash;
  REP(i,N){
    pll tmp = make_pair(mp1[que1.find(i)], mp2[que2.find(i)]);
    hash[tmp]++;
  }

  REP(i,N){
    pll tmp = make_pair(mp1[que1.find(i)], mp2[que2.find(i)]);
    printf("%lld ", hash[tmp]);
  }
  printf("\n");

  return 0;
}

Measured memory_bytes: 39496