#include <string>
#include <vector>
#include <list>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include "disjoint_set.hpp"
#include "TheSocialNetwork.hpp"
using namespace std;
using plank::Disjoint_Set;

int TheSocialNetwork::minimumCut(int n, int m, vector <int> &u, vector <int> &v, vector <int> &l)
{
  return 0;
}