Problem: Ringo has an undirected graph G with N vertices numbered 1,2,...,N and M edges numbered 1,2,...,M. Edge i connects Vertex a_{i} and b_{i} and has a length of w_i.

Now, he is in the middle of painting these N vertices in K colors numbered 1,2,...,K. Vertex i is already painted in Color c_i, except when c_i = 0, in which case Vertex i is not yet painted.

After he paints each vertex that is not yet painted in one of the K colors, he will give G to Snuke.

Based on G, Snuke will make another undirected graph G' with K vertices numbered 1,2,...,K and M edges. Initially, there is no edge in G'. The i-th edge will be added as follows:

* Let x and y be the colors of the two vertices connected by Edge i in G.
* Add an edge of length w_i connecting Vertex x and y in G'.



What is the minimum possible sum of the lengths of the edges in the minimum spanning tree of G'? If G' will not be connected regardless of how Ringo paints the vertices, print -1.

Constraints

* 1 \leq N,M \leq 10^{5}
* 1 \leq K \leq N
* 0 \leq c_i \leq K
* 1 \leq a_i,b_i \leq N
* 1 \leq w_i \leq 10^{9}
* The given graph may NOT be simple or connected.
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N M K
c_1 c_2 ... c_{N}
a_1 b_1 w_1
:
a_M b_M w_M


Output

Print the answer.

Examples

Input

4 3 3
1 0 1 2
1 2 10
2 3 20
2 4 50


Output

60


Input

5 2 4
0 0 0 0 0
1 2 10
2 3 10


Output

-1


Input

9 12 9
1 2 3 4 5 6 7 8 9
6 9 9
8 9 6
6 7 85
9 5 545631016
2 1 321545
1 6 33562944
7 3 84946329
9 7 15926167
4 7 53386480
5 8 70476
4 6 4549
4 8 8


Output

118901402


Input

18 37 12
5 0 4 10 8 7 2 10 6 0 9 12 12 11 11 11 0 1
17 1 1
11 16 7575
11 15 9
10 10 289938980
5 10 17376
18 4 1866625
8 11 959154208
18 13 200
16 13 2
2 7 982223
12 12 9331
13 12 8861390
14 13 743
2 10 162440
2 4 981849
7 9 1
14 17 2800
2 7 7225452
3 7 85
5 17 4
2 13 1
10 3 45
1 15 973
14 7 56553306
16 17 70476
7 18 9
9 13 27911
18 14 7788322
11 11 8925
9 13 654295
2 10 9
10 1 545631016
3 4 5
17 12 1929
2 11 57
1 5 4
1 17 7807368


Output

171

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define int long long
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
		freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 2e5 + 5;
struct Edge {
	int from, to, cost;
	bool operator<(const Edge &rhs) const {
		return cost < rhs.cost;
	}
} e[N];
int n, m, k, c[N], newID[N], maxCost[N];
struct DSU {
	int n, p[N], sz[N];
	void init(int _n) {
		n = _n;
		fw (i, 0, n) p[i] = i, sz[i] = 1;
	}
	int getp(int u) {
		return u == p[u] ? u : p[u] = getp(p[u]);
	}
	bool joint(int u, int v) {
		u = getp(u), v = getp(v);
		if (u == v) return 0;
		if (sz[u] < sz[v]) swap(u, v);
		sz[u] += sz[v];
		p[v] = u;
		return 1;
	}
} groups, spanningTree;
signed main() {
	#ifdef BLU
	in("blu.inp");
	#endif
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	//Treat uncolored vertexes as vertexes in new graph, then connect an edge cost 0 to its color.
	cin >> n >> m >> k;
	fw (i, 0, n) cin >> c[i], c[i]--;
	int ptr = k;
	memset(newID, -1, sizeof newID);
	fw (i, 0, n) {
		if (c[i] == -1) newID[i] = ptr++;
		else newID[i] = c[i];
	}
	fw (i, 0, m) {
		cin >> e[i].from >> e[i].to >> e[i].cost;
		e[i].from--, e[i].to--;
	}
	sort(e, e + m);
	groups.init(ptr);
	fw (i, 0, m) groups.joint(newID[e[i].from], newID[e[i].to]);
	int cntGroups = 0, cntUnknown = ptr - k;
	fw (i, 0, ptr) if (groups.getp(i) == i) cntGroups++;
//	fw (i, 0, n) cout << newID[i] << "\n";
	if (cntUnknown < cntGroups - 1) {
		cout << "-1";
		return 0;
	}
	//Each "unknown" vertex can be connected to a "known" vertex with cost 0.
	int ans = 0;
	spanningTree.init(ptr);
	int cntEdges = 0;
	fw (i, 0, m) {
		if (cntEdges == k - 1) break;
		if (spanningTree.joint(newID[e[i].from], newID[e[i].to])) {
			ans += e[i].cost;
			cntEdges++;
		}
	}
	cout << ans;
	return 0;
}