using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var map = NArr(m);
        var e = new int[k];
        for (var i = 0; i < k; ++i) e[i] = NN - 1;
        var list = new List<(int from, int to, int len)>();
        var pos = 0;
        var sum = 0L;
        var cost = 0L;
        var uf = new AtCoder.Dsu(n);
        for (var i = 0; i < m; ++i)
        {
            if (pos < k && i == e[pos])
            {
                uf.Merge(map[i][0] - 1, map[i][1] - 1);
                cost += map[i][2];
                ++pos;
            }
            else
            {
                list.Add((map[i][0] - 1, map[i][1] - 1, map[i][2]));
            }
            sum += map[i][2];
        }
        list.Sort((l, r) => l.len.CompareTo(r.len));
        foreach (var li in list)
        {
            if (!uf.Same(li.from, li.to))
            {
                uf.Merge(li.from, li.to);
                cost += li.len;
            }
        }
        WriteLine(sum - cost);
    }
}