#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

map <int, map <int,int> > G;
vector <int> edge[200100];
int v2g[200100];
bool passed[200100];
int ans[200100];
void dfs(int v, int g){
  if (passed[v]) {
    return;
  }
  passed[v] = true;
  G[g][v] = -1;
  v2g[v] = g;
  numa(x, edge[v]) {
    dfs(x, g);
  }
}
void dfs2(int v, int g){
  if (passed[v]) {
    return;
  }
  passed[v] = true;
  G[v2g[v]][v] = g;
  numa(x, edge[v]) {
    dfs2(x, g);
  }
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N,K,L;
  cin >> N >> K >> L;
  rep(i,K){
    int x,y;
    cin >> x >> y;
    x--; y--;
    edge[x].pb(y);
    edge[y].pb(x);
  }
  {
    int cnt = 0;
    mem(passed, 0);
    rep(i,N){
      if (!passed[i]) {
        dfs(i, cnt++);
      }
    }
  }
  rep(i,N){
    edge[i].clear();
  }
  rep(i,L){
    int x,y;
    cin >> x >> y;
    x--; y--;
    edge[x].pb(y);
    edge[y].pb(x);
  }
  {
    int cnt = 0;
    mem(passed, 0);
    rep(i,N){
      if (!passed[i]) {
        dfs2(i, cnt++);
      }
    }
  }
  mem(ans, -1);
  rep(i,N){
    if (ans[i] == -1) {
      int g = v2g[i];
      map <int,int> memo;
      for (auto g2 : G[g]) {
        memo[g2.sec] += 1;
      }
      for (auto g2 : G[g]) {
        ans[g2.fir] = memo[g2.sec];
      }
    }
    cout << ans[i] << ' ';
  }
  cout << endl;
  return 0;
}



Measured memory_bytes: 34944