#include <cstdio> 
#include <algorithm> 
#include <vector> 
#include <set> 
#include <cstring>

#define X first
#define Y second
#define PB push_back

using namespace std; 

typedef long long ll;
typedef pair<int, int> pii;

const int N = 4e5 + 10; 
const int OO = 2e9 + 10;

int n, m, q, A[N], B[N], C[N]; 

int SE[N], U[N];

int trazi(int u) {
	return U[u] == -1 ? u : U[u] = trazi(U[u]);
}

void unija(int u, int v) {
	u = trazi(u); 
	v = trazi(v); 
	U[v] = u;
}

int SIZ[N], MIN[N]; 
set<pii> E[N], OUT; 

void mst() {
	for(int i = 0; i < m; ++i) SE[i] = i;
	memset(U, -1, sizeof(U));

	sort(SE, SE + m, [](int a, int b) { return A[B[a]] + A[C[a]] < A[B[b]] + A[C[b]]; });

	for(int i = 0; i < m; ++i) {
		int ind = SE[i]; 
		if(trazi(B[ind]) != trazi(C[ind])) {
			unija(trazi(B[ind]), trazi(C[ind]));
//			printf("+ %d <-> %d\n", B[ind], C[ind]);
			E[B[ind]].insert({A[B[ind]] + A[C[ind]], ind});
			E[C[ind]].insert({A[B[ind]] + A[C[ind]], ind});
		}
	}
}

ll MST[N];

int main() {
	memset(U, -1, sizeof(U));	
	
	scanf("%d%d%d", &n, &m, &q);

	int mn = OO, mx = 0;
	ll sum = 0;
	for(int i = 1; i <= n; ++i) {
		scanf("%d", A + i);
		mx = max(mx, A[i]); 
		mn = min(mn, A[i]);
		sum += A[i];
	}
	for(int i = 0; i < m; ++i) scanf("%d%d", B + i, C + i); 

	mst(); 
	
	for(int i = 1; i <= n; ++i) {
		U[i] = -1;
		SIZ[i] = 1;
		MIN[i] = A[i];
	
		ll val = (*E[i].begin()).X;
//		printf("comp %d -> %lld %lld (%d, %d)\n", i, val, MIN[i], B[E[i].begin()->Y], C[E[i].begin()->Y]);
		OUT.insert({val - MIN[i], i});
	}
	
	ll res = sum - mn;
	for(int i = n - 1; i >= 0; --i) {
		MST[i] = res;

		int u = OUT.begin()->Y, e = E[u].begin()->Y, v;
		if(int _v = trazi(B[e]); u == _v) v = trazi(C[e]);
		else v = _v;
		
//		printf("add %d - %d (%d, %d)\n", B[e], C[e], u, v);
		res += OUT.begin()->X; 
		OUT.erase({E[u].begin()->X - MIN[u], u});
		OUT.erase({E[v].begin()->X - MIN[v], v});

		if(SIZ[u] < SIZ[v]) swap(v, u); 	
		unija(u, v); 
		SIZ[u] += SIZ[v];

		for(auto &x : E[v]) E[u].insert(x);
		MIN[u] = min(MIN[u], MIN[v]);

		for(; !E[u].empty() && trazi(B[E[u].begin()->Y]) == trazi(C[E[u].begin()->Y]); E[u].erase(E[u].begin())) {}
		OUT.insert({E[u].begin()->X - MIN[u], u});
	}

	for(int i = 0; i <= q; ++i) {
		int x = min(i, n - 1);
		printf("%lld\n", MST[x] + (ll) mn * x - sum + mx);
	}
	return 0;
}