50 50
75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10 62 48 52 69 87 97 95 30 74 21 42 36 64 31 80 81 50 56 53 33 99
26 30 5 33 35 29 6 15 36 17 32 16 14 1 29 34 22 40 12 42 38 48 39 50 13 47 18 43 10 8 49 45 11 31 21 37 46 28 20 41 2 7 9 24 27 23 3 44 15 14
 10 10
61 59 97 16 2 94 57 48 91 93
2 8 6 5 3 1 3 4 9 10
 2 1
1 2
1
 3 3
10 20 30
1 2 3
 50 60
86 57 45 93 17 12 40 10 47 80 18 80 3 9 6 55 13 99 5 76 4 70 100 55 27 91 71 3 65 93 41 74 80 56 90 50 58 13 71 9 47 52 26 73 72 21 15 81 88 28
40 32 5 16 49 23 3 17 14 10 1 15 1 21 28 22 13 45 12 25 44 48 46 32 36 43 11 8 49 7 7 35 10 14 39 4 42 10 30 27 1 17 31 15 8 41 44 33 25 26 19 18 29 37 50 6 36 38 47 9
 2 7
20 30
1 1 1 2 2 2 2
 2 2
10 12
2 1
 5 1
16 87 36 16 81
3
 2 3
20 30
1 1 1
 2 10
39 26
1 1 2 2 2 2 2 2 1 2

63929
 2137
 0
 40
 62514
 20
 12
 0
 0
 104


 #include<bits/stdc++.h>
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef map<string, int> maps;
typedef map<int, int> mapi;
 
#define int long long
#define db double
#define add push_back
#define rem pop_back
#define mod 1000000007
#define all(a) a.begin(), a.end()
#define sz(a) int((a).size())
#define BS(i, j, k) binary_search(i, j, k)
#define prec(n) fixed<<setprecision(n)
 
void input(int *a, int size)  { for(int i = 0; i < size; ++i) cin >> a[i]; }
void output(int *a, int size) { for(int i = 0; i < size; ++i) cout << a[i] << " "; cout<<endl; }
 
#define repi(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define rep(i, a, b)  for(int i = a; i <  b; i++)
#define repn(i, a, b) for(int i = a; i <= b; i++)
#define repv(i, b, a) for(int i = b - 1; i >= a; i--)
#define _1 first
#define _2 second
 
const double EPS = 1e-9;
const double PI = acos(-1.);
const int MOD = 1e9 + 7;
const int MAXN = 120001;
int INF = __INT64_MAX__;
int MAX = -1e9;
int MIN = 1e9;
string YN[] = {"NO", "YES"};
 
bool isPrime(int n)
{
          if (n <= 1)  return false;
          if (n <= 3)  return true;
 
          if (n%2 == 0 || n%3 == 0) return false;
 
          for (int i=5; i*i<=n; i=i+6)
                    if (n%i == 0 || n%(i+2) == 0)
                              return false;
          return true;
}
 
int A[MAXN], B[MAXN], s;
int used[MAXN];
vector<int> comp;
vector< vector<int> > graph(MAXN);
void dfs(int v)
{
	used[v] = 1;
	comp.add(v);
	for(auto i : graph[v])
		if(!used[i])
			dfs(i);
 
}
void solution()
{
          int n, m;
          cin >> n >> m;
          repn(i, 1, n) cin >> A[i];
          while(m--){
			int x, y;
			cin >> x >> y;
			graph[x].add(y);
			graph[y].add(x);
          }
          repn(i, 1, n){
          	comp.clear();
          	int Min = 1e9;
			if(!used[i])
				dfs(i);
			else
				continue;
			for(auto i : comp)
				Min = min(A[i], Min);
 
			s += Min;
          }
          cout << s;
}
__INT16_C() main()
{
          ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
          int t = 1;
          // cin >> t;
          while(t--) solution();
}