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>
using namespace std;
const int Maxn = 200005;
int n, cnt, tot, root, w[Maxn], siz[Maxn], maxi[Maxn], head[Maxn];
double now, sum, d[Maxn];
bool vis[Maxn];
pair<int, double> ans;
struct edg {
  int nxt, to, w;
} edge[2 * Maxn];
void add(int x, int y, int w) {
  edge[++cnt] = (edg){head[x], y, w};
  head[x] = cnt;
}
void get_root(int u, int fa) {
  siz[u] = maxi[u] = 1;
  for (int i = head[u]; i; i = edge[i].nxt) {
    int to = edge[i].to;
    if (to != fa && !vis[to]) {
      get_root(to, u);
      siz[u] += siz[to];
      maxi[u] = max(maxi[u], siz[to]);
    }
  }
  maxi[u] = max(maxi[u], tot - siz[u]);
  if (maxi[u] < maxi[root]) root = u;
}
void dfs(int u, int fa, int rt, int dis) {
  now += dis * sqrt(dis) * w[u], d[rt] += sqrt(dis) * 1.5 * w[u];
  for (int i = head[u]; i; i = edge[i].nxt) {
    int to = edge[i].to;
    if (to != fa) dfs(to, u, rt, dis + edge[i].w);
  }
}
void divide(int u) {
  now = sum = 0;
  vis[u] = true;
  for (int i = head[u]; i; i = edge[i].nxt) {
    int to = edge[i].to;
    d[to] = 0, dfs(to, u, to, edge[i].w), sum += d[to];
  }
  if (now < ans.second) ans = make_pair(u, now);
  for (int i = head[u]; i; i = edge[i].nxt) {
    int to = edge[i].to;
    if (!vis[to] && sum - 2 * d[to] < 0) {
      get_root(to, u), root = 0, tot = siz[to], get_root(to, u);
      divide(root);
    }
  }
}
int main() {
  ans.second = 1e18;
  maxi[0] = 0x3f3f3f3f;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  for (int i = 1; i < n; i++) {
    int x, y, w;
    scanf("%d%d%d", &x, &y, &w);
    add(x, y, w), add(y, x, w);
  }
  tot = n, get_root(1, 0);
  divide(root);
  printf("%d %.10lf", ans.first, ans.second);
  return 0;
}
