1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
//Tadrion
#include <cstdio>
#include <vector>
#include <iostream>
#include <deque>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <utility>
using namespace std;
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#define MIN(a,b) ((a) < (b) ? (a) : (b))
#define CLEAR(x) (memset(x,0,sizeof(x)))
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define VAR(v, n) __typeof(n) v = (n)
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define FOREACH(i, c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define DBG(v) cout<<#v<<" = "<<v<<endl;
#define IN(x,y) ((y).find(x)!=(y).end())
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
int n,m,k;
int nr[200010];
map<int,int> f[200010];
vector<PII> r[200010];
vector<PII> kroki;
int g,x,y;

void sw(int* a, int* b) {
    *a^=*b;
    *b^=*a;
    *a^=*b;
}

LL glob=0;
int main() {
  scanf("%d %d %d",&n,&m,&k);
  FOR(i,1,n) {scanf("%d",&g); f[i][i] = g; nr[i] = i;}
  FOR(i,1,n) {
    scanf("%d %d",&x,&y);
    kroki.PB(MP(x,y));
  }
  FOR(i,1,k) {
    scanf("%d %d",&x,&y);
    r[x].PB(MP(y,i));
    r[y].PB(MP(x,i));
  }
  REP(ttt,SZ(kroki)) {
    int n1 = nr[kroki[ttt].ST];
    int n2 = nr[kroki[ttt].ND];
    if(SZ(f[n1]) < SZ(f[n2])) sw(&n1,&n2);
    set<pair<int,PII> > pot;
    set<int> era;
    FOREACH(it,f[n2]) {
        FOREACH(jt,r[it->ST]) {
            if(IN(jt->ST,f[n1])) pot.insert(MP(jt->ND,MP(it->ST,jt->ST)));
        }
        f[n1][it->ST] += it->ND;
    }
    FOREACH(it,pot) {
        PII p = it->ND;
        int l = MIN(f[n1][p.ST],f[n1][p.ND]);
        glob = glob + ((LL)l + (LL)l);
        f[n1][p.ST] -= l;
        f[n1][p.ND] -= l;
        //printf("%d %d %d\n",p.ST,p.ND,l);
        if(f[n1][p.ST] == 0) era.insert(p.ST);
        if(f[n1][p.ND] == 0) era.insert(p.ND);
    }
    FOREACH(it,era) f[n1].erase(*it);
    nr[n2] = n1;
  }
  cout << glob << "\n";
  return 0;
}