#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

    // 整数スキャン（複数）
    /*
    int x;
    scanf("%d",&x);
    int y;
    scanf("%d",&y);
    int z;
    scanf("%d",&z);

    // n個の整数のスキャン
    /*
    ll a[n] = {};
    rep(i,n){
        scanf("%lld",&a[i]);
    }
    */

    // 文字列スキャン
    /*
    string s;
    cin >> s;
    */

    // n個の文字列スキャン
    /*
    vector<string> slist;
    rep(i,n){
        string s;
        cin >> s;
        slist.push_back(s);
    }
    */



// n要素で初期化
void init(int par[], int rank[], int n){
    for(int i=0;i<n;i++){
        par[i] = i;
        rank[i] = 0;
    }
}

// 木の根を求める
int find(int par[], int x){
    if(par[x] == x){
        return x;
    }else{
        return par[x] = find(par,par[x]);
    }
}

// xとyの属する集合を併合
void unite(int par[], int rank[], int x, int y){
    x = find(par,x);
    y = find(par,y);
    if(x == y) return;

    if(rank[x] < rank[y]){
        par[x] = y;
    }else{
        par[y] = x;
        if(rank[x] == rank[y]) rank[x]++;
    }
}

// xとyが同じ集合に属するか否か
bool same(int par[], int x, int y){
    return find(par,x) == find(par,y);
}


int cmp1(const void *a, const void *b){ // 昇順
    // qsort
    // http://www.cc.kyoto-su.ac.jp/~yamada/ap/qsort.html

    return *(int*)a - *(int*)b;
}
int cmp2(const void *a, const void *b){ // 降順
    // qsort
    // http://www.cc.kyoto-su.ac.jp/~yamada/ap/qsort.html

    return *(int*)b - *(int*)a;
}

int main() {
    int n,m;
    scanf("%d%d",&n,&m);
    int a[n] = {};
    rep(i,n){
        scanf("%d",&a[i]);
    }
    //cout << "ok1";
    int par[n]; // 親
    int rank[n]; // 木の深さ
    init(par,rank,n);

    // 島を併合
    rep(i,m){
        int x,y;
        cin >> x >> y;
        unite(par,rank,x,y);
    }
    //cout << "ok2";
    // 不可能判定
    if((n-m)>(n/2)+1){
        puts("Impossible");
        return 0;
    }

    ll ans = 0;

    if(n-m==1){
        cout << ans << endl;
        return 0;
    }

    
    // 各木のコストの低い島を探す。
    int q[n][3];
    rep(i,n){
        find(par,i);
        q[i][0] = par[i];
        q[i][1] = a[i];
        q[i][2] = i;
    }
    qsort(q, n, sizeof(q[0]), cmp1); // 1列目で昇順ソート
    //cout << "ok3";
    /*
    rep(i,n){
        cout << q[i][0];
    }
    */
    vector<vector<int>> dpp;
    dpp.resize(n-m);
    //int dp[n-m][m+100];
    int dpc[n-m] = {};
    int qcount = 0;
    int now = q[0][0];
    rep(i,n){
        if(now!=q[i][0]){
            qcount++;
            now = q[i][0];
        }
        dpp[qcount].push_back(q[i][1]); 
        //dp[qcount][dpc[qcount]] = q[i][1];
        dpc[qcount]++;
    }
    //cout << "okkk";
    rep(i,n-m){
        sort(dpp[i].begin(),dpp[i].end());
    }
    //cout << "ok4";
    int count = 0;
    int flag[n-m] = {};
    int forest = n-m; // 残っている木の数
        
    if(count == (n-m-1)*2){
        cout << ans << endl;
        return 0; // 併合完了
    }
    rep(i,n-m){
        ans += dpp[i][0];
    }
    if(n-m==2){
        cout << ans << endl;
        return 0;
    }

    int vect[n+1000];
    int vc = 0;
    rep(i,n-m){
        srep(j,1,dpc[i]){
            vect[vc] = dpp[i][j];
            vc++;
        }
    }
    //cout << "ok5";
    sort(vect,vect+vc);
    rep(i,min(n-m-2,vc)){
        ans += vect[i];
    }
    
    cout << ans << endl;
    return 0;
}
 
 


Measured memory_bytes: 6120