#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
ll cost[200001];
int rep_[200001];
int comp_min[200001];
multiset<pll> out_edges[200001];
vector<pair<ll,pii>> edges_mst;
int fint(int v)
{
if(rep_[v] == v) return v;
return rep_[v] = fint(rep_[v]);
}
void onion(int a, int b)
{
rep_[fint(a)] = fint(b);
}
multiset<pll> total_best;
void onion2(int a, int b, int num)
{
int a2 = a;
int b2 = b;
a = fint(a);
b = fint(b);
if(siz(out_edges[a]) > siz(out_edges[b]))
{
swap(a,b);
swap(a2,b2);
}
total_best.erase({(*out_edges[a].begin()).ff-comp_min[a],a});
total_best.erase({(*out_edges[b].begin()).ff-comp_min[b],b});
out_edges[a].erase({cost[a2]+cost[b2],num});
out_edges[b].erase({cost[a2]+cost[b2],num});
forall(it,out_edges[a])
{
out_edges[b].insert(it);
}
comp_min[b] = min(comp_min[a],comp_min[b]);
rep_[a] = b;
total_best.insert({(*out_edges[b].begin()).ff-comp_min[b],b});
}
ll query_ans[200001];
int main()
{
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n,m,q;
cin >> n >> m >> q;
rep2(i,1,n) cin >> cost[i];
rep2(i,1,n) rep_[i] = i;
vector<pair<ll,pii>> edges;
rep(i,m)
{
int a,b;
cin >> a >> b;
edges.pb({cost[a]+cost[b],{a,b}});
}
sort(all(edges));
ll max_ = 0;
ll min_ = 1e18;
ll sum = 0;
rep2(i,1,n) sum -= cost[i];
rep2(i,1,n) max_ = max(max_,cost[i]);
rep2(i,1,n) min_ = min(min_,cost[i]);
sum += max_;
forall(it,edges)
{
if(fint(it.ss.ff) == fint(it.ss.ss)) continue;
onion(it.ss.ff,it.ss.ss);
edges_mst.pb(it);
}
ll ans = 0;
rep2(i,1,n) ans += cost[i];
rep2(i,1,n)
{
rep_[i] = i;
comp_min[i] = cost[i];
}
rep(i,siz(edges_mst))
{
out_edges[edges_mst[i].ss.ff].insert({cost[edges_mst[i].ss.ff]+cost[edges_mst[i].ss.ss],i});
out_edges[edges_mst[i].ss.ss].insert({cost[edges_mst[i].ss.ff]+cost[edges_mst[i].ss.ss],i});
}
rep2(i,1,n)
{
total_best.insert({(*out_edges[i].begin()).ff-cost[i],i});
}
for(int i = n; i >= 2; i--)
{
query_ans[i] = ans+(i-2)*min_+sum;
ll best = (*out_edges[(*total_best.begin()).ss].begin()).ss;
ans += -max(comp_min[fint(edges_mst[best].ss.ff)],comp_min[fint(edges_mst[best].ss.ss)])+cost[edges_mst[best].ss.ff]+cost[edges_mst[best].ss.ss];
onion2(edges_mst[best].ss.ff,edges_mst[best].ss.ss,best);
}
query_ans[1] = ans+(-1)*min_+sum;
rep(qq,q+1)
{
cout << query_ans[min(n,qq+1)] << "\n";
}
}
