Problem: DZY loves Physics, and he enjoys calculating density.

Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows: 

<image> where v is the sum of the values of the nodes, e is the sum of the values of the edges.

Once DZY got a graph G, now he wants to find a connected induced subgraph G' of the graph, such that the density of G' is as large as possible.

An induced subgraph G'(V', E') of a graph G(V, E) is a graph that satisfies:

  * <image>; 
  * edge <image> if and only if <image>, and edge <image>; 
  * the value of an edge in G' is the same as the value of the corresponding edge in G, so as the value of a node. 



Help DZY to find the induced subgraph with maximum density. Note that the induced subgraph you choose must be connected.

<image>

Input

The first line contains two space-separated integers n (1 ≤ n ≤ 500), <image>. Integer n represents the number of nodes of the graph G, m represents the number of edges.

The second line contains n space-separated integers xi (1 ≤ xi ≤ 106), where xi represents the value of the i-th node. Consider the graph nodes are numbered from 1 to n.

Each of the next m lines contains three space-separated integers ai, bi, ci (1 ≤ ai < bi ≤ n; 1 ≤ ci ≤ 103), denoting an edge between node ai and bi with value ci. The graph won't contain multiple edges.

Output

Output a real number denoting the answer, with an absolute or relative error of at most 10 - 9.

Examples

Input

1 0
1


Output

0.000000000000000


Input

2 1
1 2
1 2 1


Output

3.000000000000000


Input

5 6
13 56 73 98 17
1 2 56
1 3 29
1 4 42
2 3 95
2 4 88
3 4 63


Output

2.965517241379311

Note

In the first sample, you can only choose an empty subgraph, or the subgraph containing only node 1.

In the second sample, choosing the whole graph is optimal.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double inf = 1e14;
const double eps = 1e-6;
const double eps2 = 1e-18;
const int maxn = 555;
const int maxm = maxn * maxn;
struct Edge {
  int v, next;
  double c;
} p[maxm << 1];
int head[maxn], e, d[maxn], cur[maxn], n, m, st, en;
void init() {
  e = 0;
  memset(head, -1, sizeof(head));
}
void addEdge(int u, int v, double c) {
  p[e].v = v;
  p[e].c = c;
  p[e].next = head[u];
  head[u] = e++;
  swap(u, v);
  p[e].v = v;
  p[e].c = 0;
  p[e].next = head[u];
  head[u] = e++;
}
int bfs(int st, int en) {
  queue<int> q;
  memset(d, 0, sizeof(d));
  d[st] = 1;
  q.push(st);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = head[u]; i + 1; i = p[i].next) {
      if (p[i].c > 0 && !d[p[i].v]) {
        d[p[i].v] = d[u] + 1;
        q.push(p[i].v);
      }
    }
  }
  return d[en];
}
double dfs(int u, double a) {
  if (u == en || fabs(a) <= eps2) return a;
  double f, flow = 0;
  for (int& i = cur[u]; i + 1; i = p[i].next) {
    if (d[u] + 1 == d[p[i].v] && (f = dfs(p[i].v, min(a, p[i].c))) > 0) {
      p[i].c -= f;
      p[i ^ 1].c += f;
      flow += f;
      a -= f;
      if (fabs(a) <= eps2) break;
    }
  }
  return flow;
}
double dinic(int st, int en) {
  double ret = 0;
  while (bfs(st, en)) {
    for (int i = 0; i <= n; ++i) cur[i] = head[i];
    ret += dfs(st, inf);
  }
  return ret;
}
int deg[maxn], a[maxm], b[maxm], c[maxm];
int val[maxn];
void build(double mid) {
  init();
  for (int i = 0; i < m; ++i) {
    addEdge(a[i], b[i], mid * c[i]);
    addEdge(b[i], a[i], mid * c[i]);
  }
  for (int i = 1; i <= n; ++i) {
    addEdge(st, i, 1.0 * m);
    addEdge(i, en, 1.0 * m + 2.0 * val[i] - mid * deg[i]);
  }
}
int main() {
  while (~scanf("%d%d", &n, &m)) {
    for (int i = 1; i <= n; i++) {
      scanf("%d", &val[i]);
    }
    memset(deg, 0, sizeof(deg));
    int u, v;
    st = 0, en = n + 1;
    for (int i = 0; i < m; ++i) {
      scanf("%d%d%d", &a[i], &b[i], &c[i]);
      deg[a[i]] += c[i];
      deg[b[i]] += c[i];
    }
    double ans = 0;
    for (int i = 0; i < m; i++) {
      ans = max(ans, 1.0 * (val[a[i]] + val[b[i]]) / c[i]);
    }
    printf("%.10lf\n", ans);
  }
  return 0;
}