#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>adj[1005];
bool vis[1005];
int nodes=1, edges=0;
void dfs(int n) {
vis[n]=1;
for(auto it:adj[n])
if(!vis[it]) {
nodes++;
edges+=adj[it].size();
dfs(it);
}
}
int main() {
std::ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n, m, k, u, v;
cin>>n>>m>>k;
int a[k];
for(int i=0; i<k; i++)
cin>>a[i];
for(int i=0; i<m; i++) {
cin>>u>>v;
adj[u].push_back(v);
adj[v].push_back(u);
}
priority_queue<int>pq;
ll ans=0;
for(int i=0; i<k; i++) {
nodes=1, edges=adj[a[i]].size();
dfs(a[i]);
edges/=2;
ans+=((nodes*(nodes-1)/2)-edges);
pq.push(nodes);
}
ll mx=pq.top();
for(int i=1; i<=n; i++)
if(!vis[i]) {
nodes=1, edges=adj[i].size();
dfs(i);
edges/=2;
ans+=((nodes*(nodes-1)/2)-edges);
ans+=mx*nodes;
mx+=nodes;
}
cout<<ans;
return 0;
}
151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |