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 = 200000 + 10;
int n;
vector<pair<int, int> > g[maxn];
int w[maxn];
int ans;
double ansv;
bool rm[maxn] = {};
double dist[maxn], grad[maxn];
void dfs2(int root, int x, int p, double d) {
  dist[root] += d * sqrt(d) * w[x];
  grad[root] += sqrt(d) * w[x];
  for (pair<int, int> t : g[x]) {
    int y = t.first;
    if (y != p) dfs2(root, y, x, d + t.second);
  }
}
int go(int x) {
  double sum = 0;
  double gg = -1;
  int ch = -1;
  for (pair<int, int> t : g[x]) {
    int y = t.first;
    dist[y] = grad[y] = 0;
    dfs2(y, y, x, t.second);
    sum += dist[y];
    if (grad[y] > gg) {
      gg = grad[y];
      ch = y;
    }
  }
  if (sum < ansv) {
    ansv = sum;
    ans = x;
  }
  return ch;
}
int sz[maxn];
int dfs(int x, int p) {
  sz[x] = 1;
  for (pair<int, int> t : g[x]) {
    int y = t.first;
    if (y != p && !rm[y]) sz[x] += dfs(y, x);
  }
  return sz[x];
}
int center(int x) {
  dfs(x, -1);
  int p = -1;
  int cap = sz[x] >> 1;
  for (;;) {
    bool fg = false;
    for (pair<int, int> t : g[x]) {
      int y = t.first;
      if (!rm[y] && y != p && sz[y] > cap) {
        fg = true;
        p = x;
        x = y;
        break;
      }
    }
    if (!fg) return x;
  }
}
void solve(int x) {
  for (; x && !rm[x];) {
    int y = center(x);
    x = go(y);
    rm[y] = true;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
  for (int i = 2; i <= n; ++i) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    g[a].emplace_back(b, c);
    g[b].emplace_back(a, c);
  }
  ansv = 1e22;
  solve(1);
  printf("%d %.12f\n", ans, ansv);
  return 0;
}
