You are managing a mobile phone network, and want to offer competitive prices to connect a network.

The network has n nodes.

Your competitor has already offered some connections between some nodes, with some fixed prices. These connections are bidirectional. There are initially m connections the competitor is offering. The i-th connection your competitor is offering will connect nodes fa_i and fb_i and costs fw_i. 

You have a list of k connections that you want to offer. It is guaranteed that this set of connection does not form any cycle. The j-th of these connections will connect nodes ga_j and gb_j. These connections are also bidirectional. The cost of these connections have not been decided yet.

You can set the prices of these connections to any arbitrary integer value. These prices are set independently for each connection. After setting the prices, the customer will choose such n - 1 connections that all nodes are connected in a single network and the total cost of chosen connections is minimum possible. If there are multiple ways to choose such networks, the customer will choose an arbitrary one that also maximizes the number of your connections in it.

You want to set prices in such a way such that all your k connections are chosen by the customer, and the sum of prices of your connections is maximized.

Print the maximum profit you can achieve, or -1 if it is unbounded.

Input

The first line of input will contain three integers n, k and m (1 ≤ n, k, m ≤ 5 ⋅ 10^5, k ≤ n-1), the number of nodes, the number of your connections, and the number of competitor connections, respectively.

The next k lines contain two integers ga_i and gb_i (1 ≤ ga_i, gb_i ≤ n, ga_i not= gb_i), representing one of your connections between nodes ga_i and gb_i. Your set of connections is guaranteed to be acyclic.

The next m lines contain three integers each, fa_i, fb_i and fw_i (1 ≤ fa_i, fb_i ≤ n, fa_i not= fb_i, 1 ≤ fw_i ≤ 10^9), denoting one of your competitor's connections between nodes fa_i and fb_i with cost fw_i. None of these connections connects a node to itself, and no pair of these connections connect the same pair of nodes. In addition, these connections are given by non-decreasing order of cost (that is, fw_{i-1} ≤ fw_i for all valid i).

Note that there may be some connections that appear in both your set and your competitor's set (though no connection will appear twice in one of this sets).

It is guaranteed that the union of all of your connections and your competitor's connections form a connected network.

Output

Print a single integer, the maximum possible profit you can achieve if you set the prices on your connections appropriately. If the profit is unbounded, print -1.

Examples

Input

4 3 6
1 2
3 4
1 3
2 3 3
3 1 4
1 2 4
4 2 8
4 3 8
4 1 10


Output

14


Input

3 2 1
1 2
2 3
1 2 30


Output

-1


Input

4 3 3
1 2
1 3
1 4
4 1 1000000000
4 2 1000000000
4 3 1000000000


Output

3000000000

Note

In the first sample, it's optimal to give connection 1-3 cost 3, connection 1-2 cost 3, and connection 3-4 cost 8. In this case, the cheapest connected network has cost 14, and the customer will choose one that chooses all of your connections.

In the second sample, as long as your first connection costs 30 or less, the customer chooses both your connections no matter what is the cost of the second connection, so you can get unbounded profit in this case.
#include <bits/stdc++.h>
using namespace std;
struct data {
  int u, v, w;
} bad[500050];
int bcnt;
struct edge {
  int v, nxt, w;
} e[1000500];
int head[500050], ecnt;
void adde(int u, int v, int w) {
  e[++ecnt].v = v;
  e[ecnt].nxt = head[u];
  e[ecnt].w = w;
  head[u] = ecnt;
}
int deep[500050], pa[500050], fa[500050], n, m, k, val[500050];
void dfs(int pos, int lst) {
  deep[pos] = deep[lst] + 1;
  pa[pos] = lst;
  for (int i = head[pos]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v != lst) dfs(v, pos);
  }
}
int find_fa(int pos) {
  return fa[pos] == pos ? pos : fa[pos] = find_fa(fa[pos]);
}
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= n; ++i) fa[i] = i;
  for (int i = 1; i <= k; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    adde(u, v, 0);
    adde(v, u, 0);
    fa[find_fa(u)] = find_fa(v);
  }
  for (int i = 1; i <= m; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    if (find_fa(u) == find_fa(v))
      bad[++bcnt] = (data){u, v, w};
    else
      adde(u, v, w), adde(v, u, w), fa[find_fa(u)] = find_fa(v);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; ++i) fa[i] = i;
  for (int i = 1; i <= bcnt; ++i) {
    int u = find_fa(bad[i].u), v = find_fa(bad[i].v), w = bad[i].w;
    while (u != v) {
      if (deep[u] > deep[v]) {
        val[u] = w;
        fa[u] = find_fa(pa[u]);
        u = find_fa(pa[u]);
      } else {
        val[v] = w;
        fa[v] = find_fa(pa[v]);
        v = find_fa(pa[v]);
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = head[i]; j; j = e[j].nxt) {
      int v = e[j].v;
      if (v == pa[i]) {
        if (e[j].w == 0 && !val[i]) {
          printf("-1\n");
          return 0;
        }
        if (e[j].w == 0) ans += val[i];
      }
    }
  printf("%lld\n", ans);
}
