3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
template <typename T1, typename T2>
void ckmin(T1 &a, T2 b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
void ckmax(T1 &a, T2 b) {
  if (a < b) a = b;
}
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
int read() {
  int x = 0, f = 0;
  char ch = getchar();
  while (!isdigit(ch)) f |= ch == '-', ch = getchar();
  while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();
  return f ? -x : x;
}
const int N = 200005;
struct Edge {
  int to, nxt, val;
} edge[N << 1];
int head[N], tot;
void add(int u, int v, int w) {
  edge[++tot] = {v, head[u], w};
  head[u] = tot;
}
int a[N], n;
int ban[N], mx[N], sz[N], sum, rt;
void getrt(int u, int fa) {
  sz[u] = 1, mx[u] = -1;
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa || ban[v]) continue;
    getrt(v, u);
    mx[u] = max(mx[u], sz[v]), sz[u] += sz[v];
  }
  mx[u] = max(mx[u], sum - sz[u]);
  if (mx[u] < mx[rt]) rt = u;
}
double getans(int u, int fa, long long dis) {
  double ret = 1.0 * a[u] * dis * sqrt(dis);
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa) continue;
    ret += getans(v, u, dis + edge[i].val);
  }
  return ret;
}
int dot = -1;
double ans = 1e18;
double getdao(int u, int fa, long long dis) {
  double ret = 1.0 * a[u] * sqrt(dis);
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa) continue;
    ret += getdao(v, u, dis + edge[i].val);
  }
  return ret;
}
void dfz(int u) {
  ban[u] = 1;
  double _ = getans(u, 0, 0ll);
  if (_ < ans) ans = _, dot = u;
  double minn = 1e18;
  int cur = -1;
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (ban[v]) continue;
    double delta = getdao(v, u, edge[i].val);
    if (delta < minn) minn = delta, cur = v;
  }
  if (~cur) {
    if (sz[cur] > sz[u])
      sum -= sz[u];
    else
      sum = sz[cur];
    rt = 0;
    getrt(cur, 0);
    dfz(rt);
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int u = read(), v = read(), w = read();
    add(u, v, w), add(v, u, w);
  }
  mx[rt = 0] = 1e9, sum = n, getrt(1, 0);
  dfz(rt);
  printf("%d %.12lf\n", dot, ans);
  return 0;
}
