#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #include<cmath>

 #include<iostream>

 using namespace std;

 typedef long long ll;

 const int maxn=1e6+;

 const ll inf=1e17+;

 ll head[maxn],tot,n,m,sum;

 struct edge{

     ll to;

     ll nxt;

     ll w;

 }e[maxn<<];

 void add_edge(int u,int v,int w){

     e[tot].to=v;

     e[tot].w=w;

     e[tot].nxt=head[u];

     head[u]=tot++;

 }

 ll dp[maxn<<],cnt[maxn<<];

 void dfs(ll u,ll fa){

     for(int i=head[u];i!=-;i=e[i].nxt){

         int v=e[i].to;

         if(v==fa) continue;

         dfs(v,u);

         cnt[u]+=1ll*cnt[v];

     }

     dp[u]=min(dp[u],sum-*cnt[u]>=?sum-*cnt[u]:*cnt[u]-sum);

 }

 inline int read(){

     char k=;char ls;ls=getchar();for(;ls<''||ls>'';k=ls,ls=getchar());

     int x=;for(;ls>=''&&ls<='';ls=getchar())x=(x<<)+(x<<)+ls-'';

     if(k=='-')x=-x;return x;

 }

 int main(){

     int k=;

     while(scanf("%lld%lld",&n,&m)!=EOF&&(n||m)){

         fill(dp+,dp+n+,inf);

         memset(head,-,sizeof head);

         tot=;

         sum=;

         int a,b;

         for(int i=;i<=n;i++){

             cnt[i]=read();

             sum+=1ll*cnt[i];

         }

         for(int i=;i<m;i++){

             a=read();

             b=read();

             add_edge(a,b,);

             add_edge(b,a,);

         }

         printf("Case %d: ",++k);

         dfs(,-);

         ll ans=inf;

         for(int i=;i<=n;i++){

             ans=min(ans,dp[i]);

         }

         printf("%lld\n",ans);

     }

     return ;

 }