#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,Q,A[N];
vector<int> S[N];
int fa[N],w[N];
int GF(int x){return fa[x]^x?fa[x]=GF(fa[x]):x;}
struct edge{int x,y,w;}e[N];
ll ans[N];
void Solve(){
	scanf("%d%d%d",&n,&m,&Q);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	for(int i=1;i<=m;i++) scanf("%d%d",&e[i].x,&e[i].y),e[i].w=A[e[i].x]+A[e[i].y];
	sort(e+1,e+m+1,[](edge x,edge y){return x.w<y.w;});
	iota(fa+1,fa+n+1,1);
	copy(A+1,A+n+1,w+1);
	vector<int> val;
	int mi=*min_element(A+1,A+n+1);
	for(int i=1;i<=m;i++){
		auto [u,v,z]=e[i];
		u=GF(u);v=GF(v);
		if(u^v){
			val.push_back(z-max(w[u],w[v])-mi);
			fa[u]=v;w[v]=min(w[u],w[v]);
		}
	}
	ans[n-1]=*max_element(A+1,A+n+1)+1ll*mi*(n-2);
	for(int i=n;i<=Q;i++) ans[i]=ans[i-1];
	sort(all(val));
	for(int i=n-1;i;i--) ans[i-1]=ans[i]+val[n-1-i];
	for(int i=0;i<=Q;i++) printf("%lld\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}