#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

typedef long long ll;
//typedef pair<int,int> Pint;
typedef pair<ll, ll> P;
//typedef pair<int, pair<int, int>> P;
//typedef tuple<int,int,int> T;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define revrep(i, n) for(ll i = n-1; i >= 0; i--)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll Mypow(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll gcd(ll a, ll b){//計算量はO(log(max(a,b))
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll INFL = 1LL << 60;//10^18 = 2^60
int INF = 1 << 30;//10^9
ll MOD  = 1000000007;
//vector<int> dy = {0,0,1,-1};
//vector<int> dx = {1,-1,0,0};


struct UnionFind{
  const int SIZE = 200010;
  vector<int> par, Rank;

  void init_UF(int N_){
    int N = N_;
    par.resize(N), Rank.resize(N);
    rep(i, N){
      par[i] = i;
      Rank[i] = 1;
    }
  }

  inline int find(int x){
    if(par[x] == x) return x;
    else{
      return par[x] = find(par[x]);
    }
  }

  bool same(int x, int y){
    return find(x) == find(y);
  }

  inline void unite(int x, int y){
    int rx = find(x), ry = find(y);
    if(rx != ry){
      if(Rank[rx] >= Rank[ry]){
        par[ry] = rx;
        if(Rank[rx] == Rank[ry]) Rank[rx]++;
      }else{
        par[rx] = ry;
      }
    }
  }

  void unit(vector<int> u, vector<int> v){
    rep(i, u.size()) unite(u[i], v[i]);
  }
};

int N, K, L;
vector<int> p, q, r, s;
UnionFind U, V;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N >> K >> L;
  p.resize(K), q.resize(K);
  r.resize(L), s.resize(L);
  rep(i, K){
    cin >> p[i] >> q[i];
    p[i]--, q[i]--;
  }
  rep(i, L){
    cin >> r[i] >> s[i];
    r[i]--, s[i]--;
  }

  U.init_UF(N), V.init_UF(N);
  U.unit(p, q), V.unit(r, s);
  vector<pair<int, int>> f(N);
  rep(i, N){
    f[i] = {U.find(i), V.find(i)};
  }

  map<pair<int, int>, int> mp;
  rep(i, N){
    mp[{f[i].first, f[i].second}]++;
  }
  rep(i, N) cout << mp[{f[i].first, f[i].second}] << " ";
  cout << endl;

}


Measured memory_bytes: 18088