#include <bits/stdc++.h>

#define int long long
#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=2000000007;
int mod=1000000007;
int mod1=998244353;

const int N=200007;

int a[N];
vector<int>G[N];
bool odw[N];

int ans;

void dfs(int v,int o)
{
    for(auto u:G[v])
    {
        if(u==o) continue;
        dfs(u,v);
        ans+=min(a[v],a[u]);
        ans+=max(0LL,a[v]-a[u]);
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m,k;
    cin>>n>>m>>k;
    int mx=0,r;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]>mx)
        {
            mx=a[i];
            r=i;
        }
    }
    priority_queue<pair<pair<int,int>,int>>Q;
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        G[a].pb(b);
        G[b].pb(a);
    }
    Q.push({{0,a[r]},r});
    while(sz(Q)>0)
    {
        int v=Q.top().nd,w=-Q.top().st.st;
        Q.pop();
        if(odw[v]) continue;
        odw[v]=1;
        ans+=w;
        for(auto u:G[v])
        {
            Q.push({{-a[v],-a[u]},u});
        }
    }
    cout<<ans;
    return 0;
}
/*
4 3 0
2 1 3 2
1 2
2 3
3 4
*/