#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<int> parent;
vector<int> Rank;
int n=4;
void addEdge(int i, int j, int w)
{
    adj.push_back({w,i,j});
}
void makeSet()
{
    parent.resize(n);
    Rank.resize(n);
    for(int i=0; i<n; i++)
    {
        parent[i]=-1;
        Rank[i]=1;
    }
}
int find(int i)
{
    if(parent[i]==-1) return i;
    else return parent[i]=find(parent[i]);
}
void Union(int i, int j)
{
    int s1 = find(i);
    int s2 = find(j);
    if(s1!=s2)
    {
        if(Rank[s1]<Rank[s2])
        {
            parent[s1]=s2;
            Rank[s2]+=Rank[s1];
        }
        else 
        {
            parent[s2]=s1;
            Rank[s1]+=Rank[s2];
        }
    }
}
void kruskal()
{
    makeSet();
    sort(adj.begin(), adj.end());
    int cost=0;
    for(auto edge:adj)
    {
        int wt=edge[0];
        int i=edge[1];
        int j=edge[2];
        int s1=find(i);
        int s2=find(j);
        if(s1!=s2) 
        {
            Union(s1,s2);
            cost+=wt;
        }
    }
    cout<<cost<<endl;
}
int main()
{
    addEdge(0,1,1);
 addEdge(1,3,3);
 addEdge(3,2,4);
 addEdge(2,0,2);
 addEdge(0,3,2);
 addEdge(1,2,2);
    kruskal();
}